./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.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-ap_file-29.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', '7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e'] 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-ap_file-29.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 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:21:52,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:21:52,400 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:21:52,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:21:52,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:21:52,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:21:52,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:21:52,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:21:52,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:21:52,437 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:21:52,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:21:52,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:21:52,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:21:52,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:21:52,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:21:52,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:21:52,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:21:52,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:21:52,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:21:52,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:21:52,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:21:52,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:21:52,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:21:52,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:21:52,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:21:52,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:21:52,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:21:52,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:21:52,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:21:52,442 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 -> 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e [2024-11-07 10:21:52,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:21:52,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:21:52,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:21:52,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:21:52,763 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:21:52,764 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-ap_file-29.i [2024-11-07 10:21:54,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:21:54,358 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:21:54,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i [2024-11-07 10:21:54,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baf929526/e5f68b2ca5f545cf9f224e944885455f/FLAGf627eda2c [2024-11-07 10:21:54,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/baf929526/e5f68b2ca5f545cf9f224e944885455f [2024-11-07 10:21:54,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:21:54,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:21:54,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:21:54,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:21:54,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:21:54,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6448de18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54, skipping insertion in model container [2024-11-07 10:21:54,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:21:54,554 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-ap_file-29.i[917,930] [2024-11-07 10:21:54,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:21:54,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:21:54,631 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-ap_file-29.i[917,930] [2024-11-07 10:21:54,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:21:54,692 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:21:54,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54 WrapperNode [2024-11-07 10:21:54,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:21:54,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:21:54,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:21:54,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:21:54,701 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:21:54" (1/1) ... [2024-11-07 10:21:54,709 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:21:54" (1/1) ... [2024-11-07 10:21:54,757 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-11-07 10:21:54,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:21:54,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:21:54,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:21:54,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:21:54,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,804 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-11-07 10:21:54,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:21:54,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:21:54,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:21:54,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:21:54,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (1/1) ... [2024-11-07 10:21:54,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:21:54,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:21:54,873 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:21:54,877 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:21:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:21:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:21:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:21:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:21:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:21:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:21:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:21:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:21:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:21:54,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:21:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:21:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:21:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:21:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:21:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:21:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:21:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:21:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:21:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:21:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:21:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:21:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:21:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:21:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:21:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:21:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:21:55,059 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:21:55,061 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:21:55,590 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-07 10:21:55,590 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:21:55,602 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:21:55,603 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:21:55,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:21:55 BoogieIcfgContainer [2024-11-07 10:21:55,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:21:55,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:21:55,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:21:55,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:21:55,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:21:54" (1/3) ... [2024-11-07 10:21:55,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580a8040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:21:55, skipping insertion in model container [2024-11-07 10:21:55,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:21:54" (2/3) ... [2024-11-07 10:21:55,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@580a8040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:21:55, skipping insertion in model container [2024-11-07 10:21:55,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:21:55" (3/3) ... [2024-11-07 10:21:55,612 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-29.i [2024-11-07 10:21:55,626 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:21:55,627 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:21:55,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:21:55,687 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;@7041e351, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:21:55,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:21:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:21:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:21:55,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:21:55,701 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:55,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:21:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:21:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1620841544, now seen corresponding path program 1 times [2024-11-07 10:21:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:21:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430388009] [2024-11-07 10:21:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:21:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:21:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:21:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:21:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:21:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:21:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:21:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:21:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:21:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:21:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430388009] [2024-11-07 10:21:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430388009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:21:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:21:55,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:21:55,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262925420] [2024-11-07 10:21:55,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:21:55,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:21:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:21:56,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:21:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:21:56,012 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:21:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:21:56,036 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-07 10:21:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:21:56,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:21:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:21:56,043 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:21:56,043 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:21:56,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:21:56,050 INFO L432 NwaCegarLoop]: 120 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, 120 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:21:56,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:21:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:21:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:21:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:21:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-07 10:21:56,117 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-07 10:21:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:21:56,118 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-07 10:21:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:21:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-07 10:21:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:21:56,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:21:56,122 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:56,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:21:56,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:21:56,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:21:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1061476096, now seen corresponding path program 1 times [2024-11-07 10:21:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:21:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647631535] [2024-11-07 10:21:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:21:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:21:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:21:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:21:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:21:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:21:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:21:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:21:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:21:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:21:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647631535] [2024-11-07 10:21:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647631535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:21:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:21:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:21:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567278143] [2024-11-07 10:21:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:21:56,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:21:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:21:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:21:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:21:56,468 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:21:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:21:56,512 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-07 10:21:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:21:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:21:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:21:56,516 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:21:56,516 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 10:21:56,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:21:56,517 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:21:56,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:21:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 10:21:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 10:21:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:21:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-07 10:21:56,527 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2024-11-07 10:21:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:21:56,530 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-07 10:21:56,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:21:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-07 10:21:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:21:56,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:21:56,532 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:56,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:21:56,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:21:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:21:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1102150846, now seen corresponding path program 1 times [2024-11-07 10:21:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:21:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960728096] [2024-11-07 10:21:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:21:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:21:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:21:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:21:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:21:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:21:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:21:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:21:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:21:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:21:56,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960728096] [2024-11-07 10:21:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960728096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:21:56,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:21:56,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:21:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095389737] [2024-11-07 10:21:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:21:56,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:21:56,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:21:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:21:56,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:21:56,751 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:21:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:21:56,791 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2024-11-07 10:21:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:21:56,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:21:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:21:56,795 INFO L225 Difference]: With dead ends: 172 [2024-11-07 10:21:56,796 INFO L226 Difference]: Without dead ends: 89 [2024-11-07 10:21:56,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:21:56,798 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:21:56,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:21:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-07 10:21:56,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-11-07 10:21:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:21:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-11-07 10:21:56,811 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 73 [2024-11-07 10:21:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:21:56,811 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-11-07 10:21:56,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:21:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-11-07 10:21:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:21:56,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:21:56,813 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:56,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:21:56,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:21:56,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:21:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 672856516, now seen corresponding path program 1 times [2024-11-07 10:21:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:21:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61314578] [2024-11-07 10:21:56,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:21:56,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:21:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:21:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:21:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-07 10:21:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:21:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:21:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:21:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:21:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:21:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:21:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61314578] [2024-11-07 10:21:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61314578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:21:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:21:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:21:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818339416] [2024-11-07 10:21:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:21:56,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:21:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:21:56,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:21:56,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:21:56,972 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:21:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:21:56,998 INFO L93 Difference]: Finished difference Result 176 states and 249 transitions. [2024-11-07 10:21:56,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:21:57,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:21:57,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:21:57,001 INFO L225 Difference]: With dead ends: 176 [2024-11-07 10:21:57,001 INFO L226 Difference]: Without dead ends: 91 [2024-11-07 10:21:57,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:21:57,005 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:21:57,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:21:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-07 10:21:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-07 10:21:57,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:21:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-07 10:21:57,020 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 73 [2024-11-07 10:21:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:21:57,020 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-07 10:21:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:21:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-07 10:21:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:21:57,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:21:57,022 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:57,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:21:57,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:21:57,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:21:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 674703558, now seen corresponding path program 1 times [2024-11-07 10:21:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:21:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679823247] [2024-11-07 10:21:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:21:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:21:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:21:57,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:21:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:21:57,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:21:57,259 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:21:57,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:21:57,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:21:57,265 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 10:21:57,361 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:21:57,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:21:57 BoogieIcfgContainer [2024-11-07 10:21:57,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:21:57,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:21:57,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:21:57,369 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:21:57,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:21:55" (3/4) ... [2024-11-07 10:21:57,372 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:21:57,372 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:21:57,373 INFO L158 Benchmark]: Toolchain (without parser) took 2975.48ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 43.2MB in the end (delta: 33.0MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-11-07 10:21:57,373 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:21:57,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.82ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:21:57,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.91ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 59.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:21:57,374 INFO L158 Benchmark]: Boogie Preprocessor took 76.31ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 55.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:21:57,374 INFO L158 Benchmark]: RCFGBuilder took 767.98ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 63.0MB in the end (delta: -7.8MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2024-11-07 10:21:57,374 INFO L158 Benchmark]: TraceAbstraction took 1762.34ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 43.2MB in the end (delta: 19.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-11-07 10:21:57,375 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 100.7MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 22.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:21:57,376 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.29ms. Allocated memory is still 83.9MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.82ms. Allocated memory is still 100.7MB. Free memory was 76.1MB in the beginning and 62.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.91ms. Allocated memory is still 100.7MB. Free memory was 62.1MB in the beginning and 59.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.31ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 55.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 767.98ms. Allocated memory is still 100.7MB. Free memory was 55.3MB in the beginning and 63.0MB in the end (delta: -7.8MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1762.34ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 43.2MB in the end (delta: 19.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 100.7MB. Free memory was 43.2MB in the beginning and 43.2MB 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 someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L30] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L32] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L36] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L37] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L38] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L39-L41] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L42] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L43] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L77] float_Array_0[0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L81] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L96] RET updateVariables() [L97] CALL step() [L47] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L47] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L48] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L48] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L49] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L49] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L50] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L50] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L56] COND FALSE !(((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L59] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L61] signed long int stepLocal_0 = 5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L62] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L62] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, stepLocal_0=1270, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L62] COND FALSE !((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L69] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L70] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L70] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) [L88] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L88] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L88] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88-L89] return ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 1146 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 472 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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:21:57,403 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-ap_file-29.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 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:21:59,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:21:59,680 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:21:59,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:21:59,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:21:59,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:21:59,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:21:59,715 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:21:59,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:21:59,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:21:59,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:21:59,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:21:59,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:21:59,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:21:59,716 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:21:59,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:21:59,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:21:59,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:21:59,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:21:59,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:21:59,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:21:59,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:21:59,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:21:59,719 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:21:59,720 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:21:59,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:21:59,720 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:21:59,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:21:59,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:21:59,720 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:21:59,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:21:59,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:21:59,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:21:59,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:21:59,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:21:59,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:21:59,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:21:59,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:21:59,722 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:21:59,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:21:59,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:21:59,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:21:59,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:21:59,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:21:59,723 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 -> 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e [2024-11-07 10:21:59,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:22:00,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:22:00,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:22:00,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:22:00,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:22:00,010 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-ap_file-29.i [2024-11-07 10:22:01,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:22:01,600 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:22:01,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i [2024-11-07 10:22:01,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3296e9ea/c1cbe5dd71854140807ff01484cc26ce/FLAGc9bb63a44 [2024-11-07 10:22:01,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3296e9ea/c1cbe5dd71854140807ff01484cc26ce [2024-11-07 10:22:01,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:22:01,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:22:01,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:22:01,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:22:01,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:22:01,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:01,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b00fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01, skipping insertion in model container [2024-11-07 10:22:01,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:01,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:22:01,797 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-ap_file-29.i[917,930] [2024-11-07 10:22:01,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:22:01,877 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:22:01,888 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-ap_file-29.i[917,930] [2024-11-07 10:22:01,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:22:01,939 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:22:01,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01 WrapperNode [2024-11-07 10:22:01,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:22:01,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:22:01,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:22:01,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:22:01,946 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:22:01" (1/1) ... [2024-11-07 10:22:01,958 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:22:01" (1/1) ... [2024-11-07 10:22:01,992 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2024-11-07 10:22:01,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:22:01,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:22:01,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:22:01,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:22:02,001 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,027 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2024-11-07 10:22:02,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:22:02,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:22:02,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:22:02,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:22:02,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (1/1) ... [2024-11-07 10:22:02,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:22:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:22:02,111 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:22:02,114 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:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:22:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:22:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:22:02,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:22:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:22:02,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:22:02,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:22:02,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:22:02,321 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:22:02,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:22:11,178 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-07 10:22:11,178 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:22:11,187 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:22:11,188 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:22:11,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:22:11 BoogieIcfgContainer [2024-11-07 10:22:11,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:22:11,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:22:11,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:22:11,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:22:11,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:22:01" (1/3) ... [2024-11-07 10:22:11,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dda4dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:22:11, skipping insertion in model container [2024-11-07 10:22:11,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:22:01" (2/3) ... [2024-11-07 10:22:11,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dda4dbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:22:11, skipping insertion in model container [2024-11-07 10:22:11,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:22:11" (3/3) ... [2024-11-07 10:22:11,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-29.i [2024-11-07 10:22:11,208 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:22:11,208 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:22:11,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:22:11,264 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;@6da3aed7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:22:11,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:22:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:22:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:11,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:11,278 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:11,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:11,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:11,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1620841544, now seen corresponding path program 1 times [2024-11-07 10:22:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:11,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050422362] [2024-11-07 10:22:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:11,296 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:22:11,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:11,299 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:22:11,302 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:22:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:11,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:22:11,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-07 10:22:11,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:22:11,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:11,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050422362] [2024-11-07 10:22:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050422362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:22:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:22:11,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:22:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107109953] [2024-11-07 10:22:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:22:11,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:22:11,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:11,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:22:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:22:11,749 INFO L87 Difference]: Start difference. First operand has 88 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 80 states have internal predecessors, (115), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:22:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:22:11,769 INFO L93 Difference]: Finished difference Result 169 states and 254 transitions. [2024-11-07 10:22:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:22:11,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:22:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:22:11,775 INFO L225 Difference]: With dead ends: 169 [2024-11-07 10:22:11,775 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 10:22:11,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:22:11,779 INFO L432 NwaCegarLoop]: 120 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, 120 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:22:11,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:22:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 10:22:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 10:22:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:22:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-11-07 10:22:11,812 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2024-11-07 10:22:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:22:11,813 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-11-07 10:22:11,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:22:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-11-07 10:22:11,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:11,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:11,819 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:11,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:22:12,020 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:22:12,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1061476096, now seen corresponding path program 1 times [2024-11-07 10:22:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295699207] [2024-11-07 10:22:12,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:12,022 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:22:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:12,024 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:22:12,025 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:22:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:12,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:22:12,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 10:22:12,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:22:12,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:12,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295699207] [2024-11-07 10:22:12,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295699207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:22:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:22:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:22:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678307157] [2024-11-07 10:22:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:22:12,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:22:12,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:22:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:22:12,443 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:22:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:22:12,527 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-11-07 10:22:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:22:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:22:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:22:12,529 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:22:12,529 INFO L226 Difference]: Without dead ends: 86 [2024-11-07 10:22:12,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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:22:12,530 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:22:12,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:22:12,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-07 10:22:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-07 10:22:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:22:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-07 10:22:12,546 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2024-11-07 10:22:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:22:12,547 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-07 10:22:12,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:22:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-07 10:22:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:12,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:12,550 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:12,564 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:22:12,751 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:22:12,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1102150846, now seen corresponding path program 1 times [2024-11-07 10:22:12,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113504134] [2024-11-07 10:22:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:12,752 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:22:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:12,754 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:22:12,755 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:22:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:13,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:22:13,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:22:13,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:22:13,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:13,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113504134] [2024-11-07 10:22:13,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113504134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:22:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:22:13,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:22:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504482377] [2024-11-07 10:22:13,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:22:13,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:22:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:22:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:22:13,205 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:22:13,365 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2024-11-07 10:22:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:22:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:22:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:22:13,368 INFO L225 Difference]: With dead ends: 176 [2024-11-07 10:22:13,369 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:22:13,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:22:13,371 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:22:13,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:22:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:22:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-11-07 10:22:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:22:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-07 10:22:13,383 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2024-11-07 10:22:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:22:13,384 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-07 10:22:13,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-07 10:22:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:13,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:13,385 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,396 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:22:13,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:22:13,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:13,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash 672856516, now seen corresponding path program 1 times [2024-11-07 10:22:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944195004] [2024-11-07 10:22:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:13,587 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:22:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:13,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:22:13,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 10:22:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:13,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:22:13,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:22:14,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:22:14,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944195004] [2024-11-07 10:22:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944195004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:22:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:22:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:22:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561320492] [2024-11-07 10:22:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:22:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:22:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:14,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:22:14,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:22:14,046 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:22:14,223 INFO L93 Difference]: Finished difference Result 184 states and 257 transitions. [2024-11-07 10:22:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:22:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:22:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:22:14,229 INFO L225 Difference]: With dead ends: 184 [2024-11-07 10:22:14,229 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 10:22:14,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:22:14,230 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:22:14,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 646 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:22:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 10:22:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-11-07 10:22:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 10:22:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2024-11-07 10:22:14,242 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 130 transitions. Word has length 73 [2024-11-07 10:22:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:22:14,242 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 130 transitions. [2024-11-07 10:22:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 130 transitions. [2024-11-07 10:22:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:14,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:14,244 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:22:14,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:22:14,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:14,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash 674703558, now seen corresponding path program 1 times [2024-11-07 10:22:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406898946] [2024-11-07 10:22:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:14,446 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:22:14,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:14,450 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:22:14,451 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:22:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:14,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:22:14,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:16,466 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-07 10:22:16,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:22:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:22:16,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:22:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:22:17,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406898946] [2024-11-07 10:22:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406898946] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:22:17,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:22:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-11-07 10:22:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852022154] [2024-11-07 10:22:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:22:17,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:22:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:22:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:22:17,161 INFO L87 Difference]: Start difference. First operand 94 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:22:17,973 INFO L93 Difference]: Finished difference Result 251 states and 346 transitions. [2024-11-07 10:22:17,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:22:17,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:22:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:22:17,975 INFO L225 Difference]: With dead ends: 251 [2024-11-07 10:22:17,975 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 10:22:17,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:22:17,976 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:22:17,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 385 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:22:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 10:22:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-07 10:22:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 146 states have (on average 1.36986301369863) internal successors, (200), 147 states have internal predecessors, (200), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 10:22:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 216 transitions. [2024-11-07 10:22:17,991 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 216 transitions. Word has length 73 [2024-11-07 10:22:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:22:17,992 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 216 transitions. [2024-11-07 10:22:17,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 216 transitions. [2024-11-07 10:22:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:17,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:17,993 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:18,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 10:22:18,194 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:22:18,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:18,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:18,194 INFO L85 PathProgramCache]: Analyzing trace with hash -913644344, now seen corresponding path program 1 times [2024-11-07 10:22:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560206798] [2024-11-07 10:22:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:18,195 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:22:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:18,197 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:22:18,198 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:22:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:18,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 10:22:18,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:19,650 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:22:21,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:22:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:22:21,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:22:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:22:21,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560206798] [2024-11-07 10:22:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560206798] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:22:21,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:22:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-07 10:22:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112437869] [2024-11-07 10:22:21,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:22:21,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:22:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:21,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:22:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:22:21,870 INFO L87 Difference]: Start difference. First operand 157 states and 216 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:22:22,372 INFO L93 Difference]: Finished difference Result 380 states and 518 transitions. [2024-11-07 10:22:22,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:22:22,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2024-11-07 10:22:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:22:22,376 INFO L225 Difference]: With dead ends: 380 [2024-11-07 10:22:22,376 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 10:22:22,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:22:22,381 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 78 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:22:22,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 281 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:22:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 10:22:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 157. [2024-11-07 10:22:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 146 states have (on average 1.3630136986301369) internal successors, (199), 147 states have internal predecessors, (199), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 10:22:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 215 transitions. [2024-11-07 10:22:22,396 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 215 transitions. Word has length 73 [2024-11-07 10:22:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:22:22,397 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 215 transitions. [2024-11-07 10:22:22,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:22:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 215 transitions. [2024-11-07 10:22:22,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:22:22,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:22:22,400 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:22,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 10:22:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:22:22,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:22:22,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:22:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash -490942518, now seen corresponding path program 1 times [2024-11-07 10:22:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:22:22,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486809385] [2024-11-07 10:22:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:22,602 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:22:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:22:22,605 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:22:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 10:22:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:22,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 10:22:22,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:24,210 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-07 10:22:24,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:22:24,570 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 10:22:24,570 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 130 treesize of output 58 [2024-11-07 10:22:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:22:24,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:22:24,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:22:24,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486809385] [2024-11-07 10:22:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486809385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:22:24,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [99334868] [2024-11-07 10:22:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:22:24,965 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:22:24,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:22:24,967 INFO L229 MonitoredProcess]: Starting monitored process 9 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:22:24,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-07 10:22:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:22:25,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:22:25,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:22:26,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-07 10:22:27,202 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-07 10:22:27,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 47 [2024-11-07 10:22:27,477 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-07 10:22:27,477 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 106 treesize of output 46 [2024-11-07 10:22:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:22:27,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:22:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [99334868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:22:27,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:22:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-11-07 10:22:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735830010] [2024-11-07 10:22:27,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:22:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 10:22:27,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:22:27,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 10:22:27,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:22:27,765 INFO L87 Difference]: Start difference. First operand 157 states and 215 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 10:22:32,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:22:35,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:22:39,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:22:42,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:22:45,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:22:48,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:22:52,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:22:56,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:22:59,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:23:02,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:23:04,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:23:07,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:23:09,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:23:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:23:11,660 INFO L93 Difference]: Finished difference Result 522 states and 713 transitions. [2024-11-07 10:23:11,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:23:11,662 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2024-11-07 10:23:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:23:11,664 INFO L225 Difference]: With dead ends: 522 [2024-11-07 10:23:11,664 INFO L226 Difference]: Without dead ends: 368 [2024-11-07 10:23:11,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2024-11-07 10:23:11,666 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 950 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 54 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:23:11,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1046 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 867 Invalid, 5 Unknown, 0 Unchecked, 42.7s Time] [2024-11-07 10:23:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-07 10:23:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 305. [2024-11-07 10:23:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 284 states have (on average 1.3626760563380282) internal successors, (387), 287 states have internal predecessors, (387), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:23:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 419 transitions. [2024-11-07 10:23:11,693 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 419 transitions. Word has length 73 [2024-11-07 10:23:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:23:11,693 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 419 transitions. [2024-11-07 10:23:11,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 10:23:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 419 transitions. [2024-11-07 10:23:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 10:23:11,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:23:11,695 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:11,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 10:23:11,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-07 10:23:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:23:12,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:23:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:23:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -844030900, now seen corresponding path program 1 times [2024-11-07 10:23:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:23:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201108391] [2024-11-07 10:23:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:23:12,097 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:23:12,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:23:12,101 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:23:12,102 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:23:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:23:12,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:23:12,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:23:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:23:12,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:23:12,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:23:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201108391] [2024-11-07 10:23:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201108391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:23:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:23:12,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:23:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079642409] [2024-11-07 10:23:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:23:12,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:23:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:23:12,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:23:12,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:23:12,409 INFO L87 Difference]: Start difference. First operand 305 states and 419 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:23:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:23:12,494 INFO L93 Difference]: Finished difference Result 607 states and 835 transitions. [2024-11-07 10:23:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:23:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2024-11-07 10:23:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:23:12,498 INFO L225 Difference]: With dead ends: 607 [2024-11-07 10:23:12,498 INFO L226 Difference]: Without dead ends: 305 [2024-11-07 10:23:12,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 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:23:12,499 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 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:23:12,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:23:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-07 10:23:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-07 10:23:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 284 states have (on average 1.3591549295774648) internal successors, (386), 287 states have internal predecessors, (386), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:23:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 418 transitions. [2024-11-07 10:23:12,517 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 418 transitions. Word has length 73 [2024-11-07 10:23:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:23:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 418 transitions. [2024-11-07 10:23:12,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 10:23:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 418 transitions. [2024-11-07 10:23:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 10:23:12,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:23:12,519 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:12,532 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:23:12,719 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:23:12,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:23:12,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:23:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2036446323, now seen corresponding path program 1 times [2024-11-07 10:23:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:23:12,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718206897] [2024-11-07 10:23:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:23:12,721 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:23:12,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:23:12,723 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:23:12,724 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:23:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:23:13,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 10:23:13,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:23:14,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2024-11-07 10:23:15,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:23:15,825 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 176 treesize of output 80 [2024-11-07 10:23:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:23:15,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:23:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:23:17,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:23:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718206897] [2024-11-07 10:23:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718206897] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:23:17,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:23:17,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-11-07 10:23:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374995167] [2024-11-07 10:23:17,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:23:17,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:23:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:23:17,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:23:17,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:23:17,563 INFO L87 Difference]: Start difference. First operand 305 states and 418 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:23:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:23:20,209 INFO L93 Difference]: Finished difference Result 793 states and 1076 transitions. [2024-11-07 10:23:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:23:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2024-11-07 10:23:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:23:20,214 INFO L225 Difference]: With dead ends: 793 [2024-11-07 10:23:20,215 INFO L226 Difference]: Without dead ends: 491 [2024-11-07 10:23:20,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:23:20,217 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 326 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:23:20,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 887 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 10:23:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-07 10:23:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 323. [2024-11-07 10:23:20,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 302 states have (on average 1.3609271523178808) internal successors, (411), 305 states have internal predecessors, (411), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:23:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 443 transitions. [2024-11-07 10:23:20,241 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 443 transitions. Word has length 74 [2024-11-07 10:23:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:23:20,242 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 443 transitions. [2024-11-07 10:23:20,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-07 10:23:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 443 transitions. [2024-11-07 10:23:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 10:23:20,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:23:20,244 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:20,254 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:23:20,445 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:23:20,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:23:20,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:23:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash -279510336, now seen corresponding path program 1 times [2024-11-07 10:23:20,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:23:20,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419930473] [2024-11-07 10:23:20,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:23:20,446 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:23:20,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:23:20,448 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:23:20,448 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:23:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:23:20,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:23:20,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:23:21,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-07 10:23:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 10:23:21,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:23:22,037 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2024-11-07 10:23:22,038 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 34 treesize of output 27 [2024-11-07 10:23:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-07 10:23:22,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:23:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419930473] [2024-11-07 10:23:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419930473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:23:22,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:23:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-11-07 10:23:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406132798] [2024-11-07 10:23:22,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:23:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 10:23:22,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:23:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 10:23:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2024-11-07 10:23:22,080 INFO L87 Difference]: Start difference. First operand 323 states and 443 transitions. Second operand has 21 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 6 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12)