./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.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', '214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.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 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:33:54,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:33:54,996 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:33:55,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:33:55,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:33:55,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:33:55,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:33:55,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:33:55,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:33:55,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:33:55,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:33:55,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:33:55,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:33:55,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:33:55,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:33:55,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:33:55,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:33:55,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:33:55,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:33:55,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:33:55,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:33:55,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:33:55,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:33:55,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:33:55,029 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 -> 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 [2024-11-07 10:33:55,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:33:55,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:33:55,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:33:55,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:33:55,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:33:55,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-07 10:33:56,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:33:56,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:33:56,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-07 10:33:56,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d5968545/d27e41bc67334739b7081d1a14a4c315/FLAG00e663f0c [2024-11-07 10:33:56,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d5968545/d27e41bc67334739b7081d1a14a4c315 [2024-11-07 10:33:56,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:33:56,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:33:56,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:33:56,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:33:56,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:33:56,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:56" (1/1) ... [2024-11-07 10:33:56,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357186ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:56, skipping insertion in model container [2024-11-07 10:33:56,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:33:56" (1/1) ... [2024-11-07 10:33:56,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:33:57,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-07 10:33:57,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:33:57,079 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:33:57,086 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-07 10:33:57,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:33:57,125 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:33:57,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57 WrapperNode [2024-11-07 10:33:57,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:33:57,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:33:57,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:33:57,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:33:57,130 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:33:57" (1/1) ... [2024-11-07 10:33:57,138 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:33:57" (1/1) ... [2024-11-07 10:33:57,173 INFO L138 Inliner]: procedures = 29, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 632 [2024-11-07 10:33:57,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:33:57,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:33:57,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:33:57,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:33:57,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,220 INFO L175 MemorySlicer]: Split 160 memory accesses to 13 slices as follows [2, 7, 30, 10, 22, 28, 9, 12, 12, 8, 7, 7, 6]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1]. [2024-11-07 10:33:57,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:33:57,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:33:57,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:33:57,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:33:57,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (1/1) ... [2024-11-07 10:33:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:33:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:33:57,295 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:33:57,296 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:33:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:33:57,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-07 10:33:57,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-07 10:33:57,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-07 10:33:57,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-07 10:33:57,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-07 10:33:57,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-07 10:33:57,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-07 10:33:57,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-07 10:33:57,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-07 10:33:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-07 10:33:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-07 10:33:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:33:57,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-07 10:33:57,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:33:57,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:33:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:33:57,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-07 10:33:57,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:33:57,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:33:57,467 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:33:57,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:33:57,897 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-07 10:33:57,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:33:57,905 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:33:57,905 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:33:57,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:57 BoogieIcfgContainer [2024-11-07 10:33:57,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:33:57,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:33:57,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:33:57,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:33:57,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:33:56" (1/3) ... [2024-11-07 10:33:57,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56143be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:57, skipping insertion in model container [2024-11-07 10:33:57,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:33:57" (2/3) ... [2024-11-07 10:33:57,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56143be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:33:57, skipping insertion in model container [2024-11-07 10:33:57,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:57" (3/3) ... [2024-11-07 10:33:57,912 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-39.i [2024-11-07 10:33:57,922 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:33:57,922 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:33:57,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:33:57,966 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;@15a51d1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:33:57,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:33:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:33:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:33:57,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:33:57,979 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:57,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:33:57,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:33:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1445380245, now seen corresponding path program 1 times [2024-11-07 10:33:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:33:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868429314] [2024-11-07 10:33:57,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:33:58,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:33:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:33:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:33:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:33:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:33:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:33:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:33:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:33:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:33:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:33:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:33:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:33:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:33:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:33:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:33:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:33:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:33:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:33:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:33:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:33:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868429314] [2024-11-07 10:33:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868429314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:33:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:33:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:33:58,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90467321] [2024-11-07 10:33:58,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:33:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:33:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:33:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:33:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:33:58,331 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:33:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:33:58,356 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-07 10:33:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:33:58,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-07 10:33:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:33:58,364 INFO L225 Difference]: With dead ends: 233 [2024-11-07 10:33:58,364 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 10:33:58,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:33:58,370 INFO L432 NwaCegarLoop]: 170 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, 170 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:33:58,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:33:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 10:33:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-07 10:33:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:33:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-07 10:33:58,402 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-07 10:33:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:33:58,403 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-07 10:33:58,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:33:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-07 10:33:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:33:58,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:33:58,406 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:58,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:33:58,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:33:58,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:33:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1187898961, now seen corresponding path program 1 times [2024-11-07 10:33:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:33:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089250443] [2024-11-07 10:33:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:33:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:33:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:00,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:00,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089250443] [2024-11-07 10:34:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089250443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:34:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464807602] [2024-11-07 10:34:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:34:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:00,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:34:00,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:34:00,660 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:01,557 INFO L93 Difference]: Finished difference Result 328 states and 481 transitions. [2024-11-07 10:34:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:34:01,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:34:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:01,559 INFO L225 Difference]: With dead ends: 328 [2024-11-07 10:34:01,559 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 10:34:01,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:34:01,561 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 249 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:01,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1307 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:34:01,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 10:34:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 126. [2024-11-07 10:34:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-07 10:34:01,573 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 128 [2024-11-07 10:34:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:01,574 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-07 10:34:01,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-07 10:34:01,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:34:01,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:01,576 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:34:01,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:01,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash -507840591, now seen corresponding path program 1 times [2024-11-07 10:34:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:01,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629326475] [2024-11-07 10:34:01,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:01,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:01,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629326475] [2024-11-07 10:34:01,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629326475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:01,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:01,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:34:01,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060828272] [2024-11-07 10:34:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:01,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:34:01,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:34:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:34:01,782 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:01,947 INFO L93 Difference]: Finished difference Result 319 states and 466 transitions. [2024-11-07 10:34:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:34:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:34:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:01,949 INFO L225 Difference]: With dead ends: 319 [2024-11-07 10:34:01,949 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 10:34:01,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:01,950 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 98 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:01,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 594 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 10:34:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-07 10:34:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 171 states have internal predecessors, (241), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:34:01,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 281 transitions. [2024-11-07 10:34:01,963 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 281 transitions. Word has length 128 [2024-11-07 10:34:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:01,964 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 281 transitions. [2024-11-07 10:34:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 281 transitions. [2024-11-07 10:34:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:34:01,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:01,965 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:34:01,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:01,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1518720433, now seen corresponding path program 1 times [2024-11-07 10:34:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35675796] [2024-11-07 10:34:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35675796] [2024-11-07 10:34:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35675796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:34:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524288228] [2024-11-07 10:34:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:34:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:34:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:34:02,167 INFO L87 Difference]: Start difference. First operand 193 states and 281 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:02,329 INFO L93 Difference]: Finished difference Result 390 states and 564 transitions. [2024-11-07 10:34:02,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:34:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:34:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:02,332 INFO L225 Difference]: With dead ends: 390 [2024-11-07 10:34:02,332 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 10:34:02,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:02,333 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 96 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:02,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 693 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 10:34:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2024-11-07 10:34:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.406015037593985) internal successors, (187), 133 states have internal predecessors, (187), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-11-07 10:34:02,341 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 128 [2024-11-07 10:34:02,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:02,343 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-11-07 10:34:02,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-11-07 10:34:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:34:02,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:02,348 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:02,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:34:02,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:02,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:02,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2096188493, now seen corresponding path program 1 times [2024-11-07 10:34:02,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816970399] [2024-11-07 10:34:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816970399] [2024-11-07 10:34:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816970399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:34:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985230358] [2024-11-07 10:34:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:03,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:34:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:03,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:34:03,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:34:03,074 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:03,453 INFO L93 Difference]: Finished difference Result 337 states and 486 transitions. [2024-11-07 10:34:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:34:03,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:34:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:03,456 INFO L225 Difference]: With dead ends: 337 [2024-11-07 10:34:03,456 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:34:03,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:34:03,457 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 82 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:03,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1102 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:34:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:34:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2024-11-07 10:34:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.406015037593985) internal successors, (187), 133 states have internal predecessors, (187), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-11-07 10:34:03,471 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 128 [2024-11-07 10:34:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:03,473 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-11-07 10:34:03,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-11-07 10:34:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:34:03,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:03,475 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:03,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:34:03,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1138278537, now seen corresponding path program 1 times [2024-11-07 10:34:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36488607] [2024-11-07 10:34:03,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36488607] [2024-11-07 10:34:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36488607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:04,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:34:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025141745] [2024-11-07 10:34:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:04,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:34:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:34:04,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:34:04,259 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:04,639 INFO L93 Difference]: Finished difference Result 337 states and 485 transitions. [2024-11-07 10:34:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:34:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-07 10:34:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:04,641 INFO L225 Difference]: With dead ends: 337 [2024-11-07 10:34:04,641 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:34:04,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:34:04,642 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 80 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:04,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 859 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:34:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:34:04,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2024-11-07 10:34:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.408) internal successors, (176), 125 states have internal predecessors, (176), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 208 transitions. [2024-11-07 10:34:04,648 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 208 transitions. Word has length 129 [2024-11-07 10:34:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:04,648 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 208 transitions. [2024-11-07 10:34:04,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 208 transitions. [2024-11-07 10:34:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 10:34:04,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:04,650 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:34:04,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash 170888346, now seen corresponding path program 1 times [2024-11-07 10:34:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:04,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418618302] [2024-11-07 10:34:04,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:04,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418618302] [2024-11-07 10:34:04,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418618302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:34:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205274350] [2024-11-07 10:34:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:04,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:34:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:34:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:04,869 INFO L87 Difference]: Start difference. First operand 144 states and 208 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:04,977 INFO L93 Difference]: Finished difference Result 374 states and 540 transitions. [2024-11-07 10:34:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:34:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2024-11-07 10:34:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:04,979 INFO L225 Difference]: With dead ends: 374 [2024-11-07 10:34:04,979 INFO L226 Difference]: Without dead ends: 233 [2024-11-07 10:34:04,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:34:04,980 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 89 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:04,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 818 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-07 10:34:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 188. [2024-11-07 10:34:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4260355029585798) internal successors, (241), 169 states have internal predecessors, (241), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 273 transitions. [2024-11-07 10:34:04,987 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 273 transitions. Word has length 130 [2024-11-07 10:34:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 273 transitions. [2024-11-07 10:34:04,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 273 transitions. [2024-11-07 10:34:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 10:34:04,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:04,989 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:04,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:34:04,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:04,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1173377948, now seen corresponding path program 1 times [2024-11-07 10:34:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174846350] [2024-11-07 10:34:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:05,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174846350] [2024-11-07 10:34:05,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174846350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:05,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:05,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:34:05,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054842529] [2024-11-07 10:34:05,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:05,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:34:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:05,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:34:05,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:34:05,134 INFO L87 Difference]: Start difference. First operand 188 states and 273 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:05,274 INFO L93 Difference]: Finished difference Result 406 states and 589 transitions. [2024-11-07 10:34:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:34:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-07 10:34:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:05,276 INFO L225 Difference]: With dead ends: 406 [2024-11-07 10:34:05,276 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 10:34:05,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:05,277 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 75 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:05,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 741 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 10:34:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 188. [2024-11-07 10:34:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2024-11-07 10:34:05,284 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 133 [2024-11-07 10:34:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:05,284 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2024-11-07 10:34:05,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2024-11-07 10:34:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:34:05,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:05,286 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:34:05,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1698063234, now seen corresponding path program 1 times [2024-11-07 10:34:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703257568] [2024-11-07 10:34:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:05,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:05,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703257568] [2024-11-07 10:34:05,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703257568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:05,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:05,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:34:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894043027] [2024-11-07 10:34:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:05,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:34:05,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:05,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:34:05,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:34:05,448 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:05,553 INFO L93 Difference]: Finished difference Result 399 states and 577 transitions. [2024-11-07 10:34:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:34:05,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-07 10:34:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:05,555 INFO L225 Difference]: With dead ends: 399 [2024-11-07 10:34:05,555 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 10:34:05,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:05,556 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 64 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:05,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 554 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 10:34:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 188. [2024-11-07 10:34:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 169 states have internal predecessors, (239), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 271 transitions. [2024-11-07 10:34:05,563 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 271 transitions. Word has length 134 [2024-11-07 10:34:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:05,563 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 271 transitions. [2024-11-07 10:34:05,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 271 transitions. [2024-11-07 10:34:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:34:05,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:05,564 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:34:05,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash -680036997, now seen corresponding path program 1 times [2024-11-07 10:34:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337305564] [2024-11-07 10:34:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:05,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:05,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337305564] [2024-11-07 10:34:05,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337305564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:05,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:05,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:34:05,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976321549] [2024-11-07 10:34:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:05,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:34:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:05,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:34:05,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:34:05,848 INFO L87 Difference]: Start difference. First operand 188 states and 271 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:05,965 INFO L93 Difference]: Finished difference Result 244 states and 340 transitions. [2024-11-07 10:34:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:34:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-07 10:34:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:05,967 INFO L225 Difference]: With dead ends: 244 [2024-11-07 10:34:05,967 INFO L226 Difference]: Without dead ends: 242 [2024-11-07 10:34:05,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:34:05,968 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 46 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:05,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 901 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-07 10:34:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 220. [2024-11-07 10:34:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 201 states have (on average 1.373134328358209) internal successors, (276), 201 states have internal predecessors, (276), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 308 transitions. [2024-11-07 10:34:05,975 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 308 transitions. Word has length 134 [2024-11-07 10:34:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:05,976 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 308 transitions. [2024-11-07 10:34:05,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 308 transitions. [2024-11-07 10:34:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 10:34:05,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:05,977 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:34:05,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:05,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1541926699, now seen corresponding path program 1 times [2024-11-07 10:34:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:05,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146344644] [2024-11-07 10:34:05,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:05,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146344644] [2024-11-07 10:34:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146344644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:34:06,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925718972] [2024-11-07 10:34:06,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:06,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:34:06,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:34:06,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:34:06,403 INFO L87 Difference]: Start difference. First operand 220 states and 308 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:34:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:06,885 INFO L93 Difference]: Finished difference Result 557 states and 786 transitions. [2024-11-07 10:34:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:34:06,886 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-07 10:34:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:06,887 INFO L225 Difference]: With dead ends: 557 [2024-11-07 10:34:06,887 INFO L226 Difference]: Without dead ends: 340 [2024-11-07 10:34:06,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:34:06,888 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 332 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:06,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1063 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:34:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-11-07 10:34:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 303. [2024-11-07 10:34:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 284 states have (on average 1.4049295774647887) internal successors, (399), 284 states have internal predecessors, (399), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 431 transitions. [2024-11-07 10:34:06,897 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 431 transitions. Word has length 135 [2024-11-07 10:34:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 431 transitions. [2024-11-07 10:34:06,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:34:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 431 transitions. [2024-11-07 10:34:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:34:06,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:06,899 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:06,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:34:06,899 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash 984381808, now seen corresponding path program 1 times [2024-11-07 10:34:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:06,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88240497] [2024-11-07 10:34:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88240497] [2024-11-07 10:34:07,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88240497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:07,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:07,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:34:07,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181778463] [2024-11-07 10:34:07,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:07,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:34:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:07,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:34:07,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:34:07,327 INFO L87 Difference]: Start difference. First operand 303 states and 431 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:34:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:07,816 INFO L93 Difference]: Finished difference Result 671 states and 944 transitions. [2024-11-07 10:34:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:34:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-11-07 10:34:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:07,819 INFO L225 Difference]: With dead ends: 671 [2024-11-07 10:34:07,819 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 10:34:07,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:34:07,820 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 264 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:07,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1050 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:34:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 10:34:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 330. [2024-11-07 10:34:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.382636655948553) internal successors, (430), 311 states have internal predecessors, (430), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 462 transitions. [2024-11-07 10:34:07,839 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 462 transitions. Word has length 136 [2024-11-07 10:34:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 462 transitions. [2024-11-07 10:34:07,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:34:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 462 transitions. [2024-11-07 10:34:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:34:07,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:07,842 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:34:07,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:07,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 937697052, now seen corresponding path program 1 times [2024-11-07 10:34:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612963106] [2024-11-07 10:34:07,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:07,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612963106] [2024-11-07 10:34:07,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612963106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:07,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:07,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:34:07,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703232045] [2024-11-07 10:34:07,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:34:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:07,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:34:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:34:07,969 INFO L87 Difference]: Start difference. First operand 330 states and 462 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:08,094 INFO L93 Difference]: Finished difference Result 683 states and 955 transitions. [2024-11-07 10:34:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:34:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-07 10:34:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:08,096 INFO L225 Difference]: With dead ends: 683 [2024-11-07 10:34:08,096 INFO L226 Difference]: Without dead ends: 356 [2024-11-07 10:34:08,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:08,097 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:08,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 518 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-07 10:34:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2024-11-07 10:34:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.3762057877813505) internal successors, (428), 311 states have internal predecessors, (428), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 460 transitions. [2024-11-07 10:34:08,106 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 460 transitions. Word has length 136 [2024-11-07 10:34:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:08,107 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 460 transitions. [2024-11-07 10:34:08,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 460 transitions. [2024-11-07 10:34:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 10:34:08,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:08,121 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:34:08,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:08,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1708154855, now seen corresponding path program 1 times [2024-11-07 10:34:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:08,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129975436] [2024-11-07 10:34:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:08,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129975436] [2024-11-07 10:34:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129975436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:08,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:34:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858294020] [2024-11-07 10:34:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:08,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:34:08,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:34:08,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:34:08,229 INFO L87 Difference]: Start difference. First operand 330 states and 460 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:08,373 INFO L93 Difference]: Finished difference Result 683 states and 951 transitions. [2024-11-07 10:34:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:34:08,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-07 10:34:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:08,375 INFO L225 Difference]: With dead ends: 683 [2024-11-07 10:34:08,375 INFO L226 Difference]: Without dead ends: 356 [2024-11-07 10:34:08,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:34:08,376 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:08,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 694 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-07 10:34:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2024-11-07 10:34:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 311 states have (on average 1.369774919614148) internal successors, (426), 311 states have internal predecessors, (426), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 458 transitions. [2024-11-07 10:34:08,385 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 458 transitions. Word has length 136 [2024-11-07 10:34:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:08,386 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 458 transitions. [2024-11-07 10:34:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 458 transitions. [2024-11-07 10:34:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:34:08,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:08,387 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:08,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:34:08,387 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1637066314, now seen corresponding path program 1 times [2024-11-07 10:34:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470339269] [2024-11-07 10:34:08,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:34:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:34:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:34:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:34:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:34:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:34:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:34:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:34:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:34:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:34:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 10:34:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 10:34:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 10:34:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 10:34:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:34:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 10:34:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:34:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470339269] [2024-11-07 10:34:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470339269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:08,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:34:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170132070] [2024-11-07 10:34:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:34:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:34:08,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:34:08,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:34:08,607 INFO L87 Difference]: Start difference. First operand 330 states and 458 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:08,724 INFO L93 Difference]: Finished difference Result 426 states and 572 transitions. [2024-11-07 10:34:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:34:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-07 10:34:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:08,727 INFO L225 Difference]: With dead ends: 426 [2024-11-07 10:34:08,727 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 10:34:08,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:34:08,728 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 61 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:08,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1301 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:34:08,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 10:34:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 387. [2024-11-07 10:34:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 368 states have (on average 1.3342391304347827) internal successors, (491), 368 states have internal predecessors, (491), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 523 transitions. [2024-11-07 10:34:08,741 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 523 transitions. Word has length 137 [2024-11-07 10:34:08,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:08,743 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 523 transitions. [2024-11-07 10:34:08,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:08,743 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 523 transitions. [2024-11-07 10:34:08,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 10:34:08,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:08,744 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:08,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:34:08,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:08,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash 79591512, now seen corresponding path program 1 times [2024-11-07 10:34:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:34:08,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102312220] [2024-11-07 10:34:08,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:34:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:34:08,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1117668338] [2024-11-07 10:34:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:34:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:34:08,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:34:08,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:34:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:34:09,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:34:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:34:09,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:34:09,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:34:09,450 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:34:09,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:34:09,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-07 10:34:09,655 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:34:09,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:34:09,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:34:09 BoogieIcfgContainer [2024-11-07 10:34:09,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:34:09,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:34:09,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:34:09,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:34:09,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:33:57" (3/4) ... [2024-11-07 10:34:09,781 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:34:09,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:34:09,782 INFO L158 Benchmark]: Toolchain (without parser) took 12849.67ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 116.1MB in the beginning and 116.0MB in the end (delta: 172.0kB). Peak memory consumption was 197.7MB. Max. memory is 16.1GB. [2024-11-07 10:34:09,782 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 81.2MB in the end (delta: 80.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:34:09,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.78ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 101.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:34:09,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.12ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 98.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:34:09,782 INFO L158 Benchmark]: Boogie Preprocessor took 96.00ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 93.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:34:09,783 INFO L158 Benchmark]: RCFGBuilder took 635.30ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 53.2MB in the end (delta: 40.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 10:34:09,783 INFO L158 Benchmark]: TraceAbstraction took 11870.74ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 52.5MB in the beginning and 116.1MB in the end (delta: -63.6MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2024-11-07 10:34:09,783 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 343.9MB. Free memory was 116.1MB in the beginning and 116.0MB in the end (delta: 132.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:34:09,784 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.23ms. Allocated memory is still 117.4MB. Free memory was 81.2MB in the beginning and 81.2MB in the end (delta: 80.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.78ms. Allocated memory is still 142.6MB. Free memory was 116.1MB in the beginning and 101.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.12ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 98.2MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 96.00ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 93.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 635.30ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 53.2MB in the end (delta: 40.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11870.74ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 52.5MB in the beginning and 116.1MB in the end (delta: -63.6MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 343.9MB. Free memory was 116.1MB in the beginning and 116.0MB in the end (delta: 132.8kB). 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 89, overapproximation of shiftLeft at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L22] signed short int var_1_1 = -5; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_2 = 0; [L24] signed short int var_1_2 = 0; [L25] signed short int* var_1_2_Pointer = &(var_1_2); [L26] signed short int var_1_3 = 1000; [L26] signed short int var_1_3 = 1000; [L27] signed short int* var_1_3_Pointer = &(var_1_3); [L28] signed short int var_1_4 = 10; [L28] signed short int var_1_4 = 10; [L29] signed short int* var_1_4_Pointer = &(var_1_4); [L30] signed short int var_1_5 = 32; [L30] signed short int var_1_5 = 32; [L31] signed short int* var_1_5_Pointer = &(var_1_5); [L32] signed long int var_1_6 = 5; [L32] signed long int var_1_6 = 5; [L33] signed long int* var_1_6_Pointer = &(var_1_6); [L34] float var_1_7 = 1.1; [L34] float var_1_7 = 1.1; [L35] float* var_1_7_Pointer = &(var_1_7); [L36] float var_1_8 = 7.8; [L36] float var_1_8 = 7.8; [L37] float* var_1_8_Pointer = &(var_1_8); [L38] float var_1_9 = 1.75; [L38] float var_1_9 = 1.75; [L39] float* var_1_9_Pointer = &(var_1_9); [L40] signed long int var_1_10 = 32; [L40] signed long int var_1_10 = 32; [L41] signed long int* var_1_10_Pointer = &(var_1_10); [L42] unsigned char var_1_11 = 64; [L42] unsigned char var_1_11 = 64; [L43] unsigned char* var_1_11_Pointer = &(var_1_11); [L44] signed long int var_1_12 = 1230482582; [L44] signed long int var_1_12 = 1230482582; [L45] signed long int* var_1_12_Pointer = &(var_1_12); VAL [isInitial=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_short() [L73] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L74] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L75] var_1_3 = __VERIFIER_nondet_short() [L76] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L76] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L77] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L77] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L77] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L78] var_1_4 = __VERIFIER_nondet_short() [L79] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L80] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L81] var_1_5 = __VERIFIER_nondet_short() [L82] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L83] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_7) [L85] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F [L85] EXPR \read(var_1_7) [L85] EXPR var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR (var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] EXPR (var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] EXPR \read(var_1_8) [L87] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L87] EXPR \read(var_1_8) [L87] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] var_1_9 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR (var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] var_1_12 = __VERIFIER_nondet_long() [L95] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] RET updateVariables() [L110] CALL step() [L49] EXPR \read(*var_1_2_Pointer) [L49] EXPR \read(*var_1_3_Pointer) [L49] EXPR \read(*var_1_4_Pointer) [L49] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L49] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L49] EXPR \read(*var_1_4_Pointer) [L49] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L49] (*(var_1_1_Pointer)) = ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))) [L50] EXPR \read(*var_1_2_Pointer) [L50] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L50] COND FALSE !((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) [L57] EXPR \read(*var_1_4_Pointer) [L57] (*(var_1_6_Pointer)) = (*(var_1_4_Pointer)) [L59] EXPR \read(*var_1_6_Pointer) [L59] EXPR \read(*var_1_4_Pointer) [L59] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] EXPR (*(var_1_4_Pointer)) << (*(var_1_2_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L59] signed long int stepLocal_1 = (*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer))); [L60] EXPR \read(*var_1_2_Pointer) [L60] EXPR \read(*var_1_12_Pointer) [L60] EXPR \read(*var_1_5_Pointer) [L60] signed long int stepLocal_0 = (*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))); [L61] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L61] COND TRUE stepLocal_1 != (*(var_1_5_Pointer)) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L62] COND FALSE !(((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < stepLocal_0) [L65] EXPR \read(*var_1_4_Pointer) [L65] (*(var_1_10_Pointer)) = (*(var_1_4_Pointer)) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR \read(*var_1_1_Pointer) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR \read(*var_1_3_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR (((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) [L101] EXPR \read(*var_1_6_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR ((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR ((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) [L101] EXPR \read(*var_1_6_Pointer) [L101] EXPR \read(*var_1_4_Pointer) [L101] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (*(var_1_4_Pointer)) << (*(var_1_2_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR \read(*var_1_5_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) [L101] EXPR \read(*var_1_10_Pointer) [L101] EXPR \read(*var_1_2_Pointer) [L101] EXPR (((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer)))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101-L102] return (((*(var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(var_1_2_Pointer))) - ((*(var_1_3_Pointer)) + (((((*(var_1_4_Pointer))) < ((*(var_1_5_Pointer)))) ? ((*(var_1_4_Pointer))) : ((*(var_1_5_Pointer))))))))) && (((*(var_1_2_Pointer)) >= (*(var_1_1_Pointer))) ? (((((((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))) : ((*(var_1_7_Pointer)) + (*(var_1_8_Pointer))))) < (*(var_1_9_Pointer))) ? ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_1_Pointer))))) : ((*(var_1_6_Pointer)) == ((signed long int) (*(var_1_4_Pointer)))))) && ((((*(var_1_6_Pointer)) + ((*(var_1_4_Pointer)) << (*(var_1_2_Pointer)))) != (*(var_1_5_Pointer))) ? ((((*(var_1_3_Pointer)) / (*(var_1_11_Pointer))) < ((*(var_1_2_Pointer)) - ((*(var_1_12_Pointer)) - (*(var_1_5_Pointer))))) ? ((*(var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer)))))))))) ? (-256) : ((((((*(var_1_4_Pointer))) < ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))) ? ((*(var_1_4_Pointer))) : ((((((*(var_1_5_Pointer))) > ((*(var_1_2_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_2_Pointer))))))))))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_4_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed long int) (*(var_1_2_Pointer))))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1665 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1665 mSDsluCounter, 12365 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9824 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4094 IncrementalHoareTripleChecker+Invalid, 4127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 2541 mSDtfsCounter, 4094 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=387occurred in iteration=15, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 513 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2254 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1965 ConstructedInterpolants, 0 QuantifiedInterpolants, 6190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 7200/7200 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:34:09,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.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 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:34:11,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:34:11,730 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:34:11,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:34:11,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:34:11,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:34:11,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:34:11,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:34:11,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:34:11,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:34:11,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:34:11,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:34:11,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:34:11,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:34:11,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:34:11,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:34:11,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:34:11,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:34:11,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:34:11,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:34:11,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:34:11,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:34:11,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:34:11,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:34:11,771 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:34:11,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:34:11,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:34:11,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:34:11,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:34:11,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:34:11,771 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 -> 214c49e8f3d3735ec742b7b163a0487f19e3afbd4fa1866f6927a51886e4b103 [2024-11-07 10:34:12,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:34:12,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:34:12,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:34:12,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:34:12,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:34:12,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-07 10:34:13,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:34:13,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:34:13,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i [2024-11-07 10:34:13,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e47bc97a/d56b7e8ddcc340f8b1202c6c5a2fdb82/FLAG2296b51ff [2024-11-07 10:34:13,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5e47bc97a/d56b7e8ddcc340f8b1202c6c5a2fdb82 [2024-11-07 10:34:13,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:34:13,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:34:13,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:34:13,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:34:13,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:34:13,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:34:13" (1/1) ... [2024-11-07 10:34:13,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273dd979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:13, skipping insertion in model container [2024-11-07 10:34:13,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:34:13" (1/1) ... [2024-11-07 10:34:13,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:34:13,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-07 10:34:14,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:34:14,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:34:14,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-39.i[916,929] [2024-11-07 10:34:14,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:34:14,072 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:34:14,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14 WrapperNode [2024-11-07 10:34:14,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:34:14,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:34:14,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:34:14,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:34:14,079 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:34:14" (1/1) ... [2024-11-07 10:34:14,088 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:34:14" (1/1) ... [2024-11-07 10:34:14,112 INFO L138 Inliner]: procedures = 36, calls = 199, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 614 [2024-11-07 10:34:14,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:34:14,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:34:14,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:34:14,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:34:14,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,159 INFO L175 MemorySlicer]: Split 160 memory accesses to 13 slices as follows [2, 7, 30, 10, 22, 28, 9, 12, 12, 8, 7, 7, 6]. 19 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1]. [2024-11-07 10:34:14,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:34:14,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:34:14,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:34:14,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:34:14,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (1/1) ... [2024-11-07 10:34:14,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:34:14,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:34:14,240 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:34:14,243 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:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-07 10:34:14,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-07 10:34:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-07 10:34:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-07 10:34:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-11-07 10:34:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-11-07 10:34:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-11-07 10:34:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-11-07 10:34:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:34:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:34:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-07 10:34:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-11-07 10:34:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-11-07 10:34:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-11-07 10:34:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-11-07 10:34:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:34:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:34:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-07 10:34:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-11-07 10:34:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:34:14,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:34:14,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:34:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2024-11-07 10:34:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2024-11-07 10:34:14,462 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:34:14,464 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:34:15,422 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-07 10:34:15,422 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:34:15,447 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:34:15,447 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:34:15,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:34:15 BoogieIcfgContainer [2024-11-07 10:34:15,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:34:15,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:34:15,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:34:15,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:34:15,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:34:13" (1/3) ... [2024-11-07 10:34:15,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740a0635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:34:15, skipping insertion in model container [2024-11-07 10:34:15,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:34:14" (2/3) ... [2024-11-07 10:34:15,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740a0635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:34:15, skipping insertion in model container [2024-11-07 10:34:15,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:34:15" (3/3) ... [2024-11-07 10:34:15,456 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-39.i [2024-11-07 10:34:15,467 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:34:15,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:34:15,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:34:15,523 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;@44d36281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:34:15,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:34:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:34:15,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:15,539 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:15,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:15,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:15,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1102926622, now seen corresponding path program 1 times [2024-11-07 10:34:15,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:34:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505252367] [2024-11-07 10:34:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:15,555 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:34:15,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:34:15,557 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:34:15,559 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:34:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:15,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:34:15,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:34:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-11-07 10:34:15,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:34:15,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:34:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505252367] [2024-11-07 10:34:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505252367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:34:15,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:34:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:34:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343417508] [2024-11-07 10:34:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:15,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:34:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:34:15,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:34:15,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:34:15,946 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 96 states have internal predecessors, (137), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:34:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:15,968 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-11-07 10:34:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:34:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2024-11-07 10:34:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:15,975 INFO L225 Difference]: With dead ends: 221 [2024-11-07 10:34:15,975 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:34:15,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:34:15,979 INFO L432 NwaCegarLoop]: 162 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, 162 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:34:15,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:34:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:34:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-07 10:34:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 10:34:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-11-07 10:34:16,007 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2024-11-07 10:34:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-11-07 10:34:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-07 10:34:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-11-07 10:34:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:34:16,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:16,012 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:16,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:34:16,213 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:34:16,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:16,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash -405452762, now seen corresponding path program 1 times [2024-11-07 10:34:16,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:34:16,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665122189] [2024-11-07 10:34:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:16,214 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:34:16,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:34:16,217 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:34:16,218 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:34:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:16,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-07 10:34:16,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:34:21,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:34:22,172 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 17 treesize of output 13 [2024-11-07 10:34:22,365 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 76 treesize of output 56 [2024-11-07 10:34:22,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-07 10:34:22,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2024-11-07 10:34:22,862 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 48 treesize of output 32 [2024-11-07 10:34:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:34:23,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:34:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:24,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:34:24,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665122189] [2024-11-07 10:34:24,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665122189] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:34:24,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:34:24,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [45] total 53 [2024-11-07 10:34:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221578871] [2024-11-07 10:34:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:24,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:34:24,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:34:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:34:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2562, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 10:34:24,383 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:26,085 INFO L93 Difference]: Finished difference Result 315 states and 462 transitions. [2024-11-07 10:34:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:34:26,086 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-07 10:34:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:26,087 INFO L225 Difference]: With dead ends: 315 [2024-11-07 10:34:26,087 INFO L226 Difference]: Without dead ends: 208 [2024-11-07 10:34:26,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=244, Invalid=2948, Unknown=0, NotChecked=0, Total=3192 [2024-11-07 10:34:26,089 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 202 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:26,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1014 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 10:34:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-07 10:34:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 158. [2024-11-07 10:34:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.4074074074074074) internal successors, (190), 136 states have internal predecessors, (190), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:34:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 230 transitions. [2024-11-07 10:34:26,108 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 230 transitions. Word has length 126 [2024-11-07 10:34:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 230 transitions. [2024-11-07 10:34:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 230 transitions. [2024-11-07 10:34:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:34:26,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:26,109 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:26,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 10:34:26,310 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:34:26,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:26,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1085511132, now seen corresponding path program 1 times [2024-11-07 10:34:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:34:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446002287] [2024-11-07 10:34:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:26,311 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:34:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:34:26,314 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:34:26,315 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:34:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:26,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-07 10:34:26,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:34:31,206 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 37 treesize of output 33 [2024-11-07 10:34:31,365 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 17 treesize of output 13 [2024-11-07 10:34:31,605 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 33 treesize of output 21 [2024-11-07 10:34:31,628 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 37 treesize of output 29 [2024-11-07 10:34:32,092 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 60 treesize of output 44 [2024-11-07 10:34:32,104 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 81 treesize of output 65 [2024-11-07 10:34:32,116 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 46 treesize of output 34 [2024-11-07 10:34:32,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 68 [2024-11-07 10:34:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:34:33,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:34:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:34,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:34:34,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446002287] [2024-11-07 10:34:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446002287] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:34:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:34:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [47] total 56 [2024-11-07 10:34:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965002667] [2024-11-07 10:34:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:34,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:34:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:34:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:34:34,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-11-07 10:34:34,766 INFO L87 Difference]: Start difference. First operand 158 states and 230 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:38,307 INFO L93 Difference]: Finished difference Result 364 states and 530 transitions. [2024-11-07 10:34:38,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 10:34:38,308 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-07 10:34:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:38,310 INFO L225 Difference]: With dead ends: 364 [2024-11-07 10:34:38,310 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 10:34:38,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=257, Invalid=3649, Unknown=0, NotChecked=0, Total=3906 [2024-11-07 10:34:38,312 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:38,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1387 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 10:34:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 10:34:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2024-11-07 10:34:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 135 states have (on average 1.4) internal successors, (189), 136 states have internal predecessors, (189), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:34:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-11-07 10:34:38,328 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 126 [2024-11-07 10:34:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:38,328 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-11-07 10:34:38,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-11-07 10:34:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:34:38,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:38,329 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:38,339 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:34:38,530 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:34:38,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:38,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1685316440, now seen corresponding path program 1 times [2024-11-07 10:34:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:34:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579721106] [2024-11-07 10:34:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:38,531 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:34:38,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:34:38,533 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:34:38,534 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:34:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:38,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 10:34:38,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:34:41,357 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 37 treesize of output 33 [2024-11-07 10:34:41,665 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 60 treesize of output 44 [2024-11-07 10:34:41,669 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 72 treesize of output 52 [2024-11-07 10:34:41,672 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 46 treesize of output 34 [2024-11-07 10:34:41,831 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 76 treesize of output 56 [2024-11-07 10:34:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 338 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-07 10:34:42,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:34:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:43,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:34:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579721106] [2024-11-07 10:34:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579721106] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:34:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:34:43,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [36] total 43 [2024-11-07 10:34:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619045276] [2024-11-07 10:34:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:43,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:34:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:34:43,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:34:43,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1665, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 10:34:43,047 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:44,380 INFO L93 Difference]: Finished difference Result 364 states and 531 transitions. [2024-11-07 10:34:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:34:44,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-07 10:34:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:44,383 INFO L225 Difference]: With dead ends: 364 [2024-11-07 10:34:44,383 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 10:34:44,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 10:34:44,384 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 76 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:44,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1105 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:34:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 10:34:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 176. [2024-11-07 10:34:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.4183006535947713) internal successors, (217), 154 states have internal predecessors, (217), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:34:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 257 transitions. [2024-11-07 10:34:44,395 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 257 transitions. Word has length 126 [2024-11-07 10:34:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:44,395 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 257 transitions. [2024-11-07 10:34:44,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 257 transitions. [2024-11-07 10:34:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:34:44,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:44,399 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,411 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:34:44,605 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:34:44,605 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1929592486, now seen corresponding path program 1 times [2024-11-07 10:34:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:34:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749136404] [2024-11-07 10:34:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:44,606 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:34:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:34:44,608 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:34:44,609 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:34:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:44,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-07 10:34:44,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:34:49,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:34:49,657 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 17 treesize of output 13 [2024-11-07 10:34:49,845 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 76 treesize of output 56 [2024-11-07 10:34:49,853 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 33 treesize of output 25 [2024-11-07 10:34:50,406 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 61 treesize of output 41 [2024-11-07 10:34:50,411 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 75 treesize of output 55 [2024-11-07 10:34:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:34:50,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:34:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:51,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:34:51,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749136404] [2024-11-07 10:34:51,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749136404] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:34:51,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:34:51,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [45] total 53 [2024-11-07 10:34:51,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040015908] [2024-11-07 10:34:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:51,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:34:51,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:34:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:34:51,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2562, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 10:34:51,966 INFO L87 Difference]: Start difference. First operand 176 states and 257 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:34:53,598 INFO L93 Difference]: Finished difference Result 431 states and 624 transitions. [2024-11-07 10:34:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:34:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 126 [2024-11-07 10:34:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:34:53,602 INFO L225 Difference]: With dead ends: 431 [2024-11-07 10:34:53,602 INFO L226 Difference]: Without dead ends: 258 [2024-11-07 10:34:53,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=244, Invalid=2948, Unknown=0, NotChecked=0, Total=3192 [2024-11-07 10:34:53,604 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 371 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:34:53,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1090 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 10:34:53,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-07 10:34:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 178. [2024-11-07 10:34:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.4129032258064516) internal successors, (219), 156 states have internal predecessors, (219), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:34:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2024-11-07 10:34:53,614 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 126 [2024-11-07 10:34:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:34:53,614 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2024-11-07 10:34:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:34:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2024-11-07 10:34:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:34:53,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:34:53,615 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:53,624 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:34:53,815 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:34:53,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:34:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:34:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 926425502, now seen corresponding path program 1 times [2024-11-07 10:34:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:34:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633198629] [2024-11-07 10:34:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:34:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:34:53,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:34:53,819 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:34:53,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 10:34:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:34:54,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-07 10:34:54,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:34:58,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:34:58,584 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 53 treesize of output 37 [2024-11-07 10:34:59,058 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 59 treesize of output 43 [2024-11-07 10:34:59,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-11-07 10:34:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:34:59,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:34:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:34:59,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:34:59,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633198629] [2024-11-07 10:34:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633198629] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:34:59,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:34:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [43] total 49 [2024-11-07 10:34:59,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577938865] [2024-11-07 10:34:59,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:34:59,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:34:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:34:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:34:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2024-11-07 10:34:59,872 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:00,469 INFO L93 Difference]: Finished difference Result 454 states and 659 transitions. [2024-11-07 10:35:00,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:35:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-07 10:35:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:00,472 INFO L225 Difference]: With dead ends: 454 [2024-11-07 10:35:00,472 INFO L226 Difference]: Without dead ends: 279 [2024-11-07 10:35:00,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=182, Invalid=2368, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 10:35:00,473 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 239 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:00,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 587 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:35:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-07 10:35:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 194. [2024-11-07 10:35:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 172 states have internal predecessors, (244), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:35:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2024-11-07 10:35:00,483 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 127 [2024-11-07 10:35:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:00,484 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2024-11-07 10:35:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2024-11-07 10:35:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:35:00,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:00,485 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:00,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:35:00,686 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:35:00,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:00,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash 246367132, now seen corresponding path program 1 times [2024-11-07 10:35:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:00,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628601085] [2024-11-07 10:35:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:00,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:00,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:00,690 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:35:00,690 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:35:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:01,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-07 10:35:01,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:03,806 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 37 treesize of output 33 [2024-11-07 10:35:04,153 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 60 treesize of output 44 [2024-11-07 10:35:04,158 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 72 treesize of output 52 [2024-11-07 10:35:04,163 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 46 treesize of output 34 [2024-11-07 10:35:04,328 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 76 treesize of output 56 [2024-11-07 10:35:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:35:04,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:35:05,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628601085] [2024-11-07 10:35:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628601085] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:35:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [36] total 43 [2024-11-07 10:35:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917484260] [2024-11-07 10:35:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:05,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:35:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:05,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:35:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1665, Unknown=0, NotChecked=0, Total=1806 [2024-11-07 10:35:05,620 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:06,838 INFO L93 Difference]: Finished difference Result 418 states and 611 transitions. [2024-11-07 10:35:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:35:06,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-07 10:35:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:06,840 INFO L225 Difference]: With dead ends: 418 [2024-11-07 10:35:06,840 INFO L226 Difference]: Without dead ends: 227 [2024-11-07 10:35:06,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 10:35:06,841 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 137 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:06,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 981 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:35:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-07 10:35:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 190. [2024-11-07 10:35:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 167 states have (on average 1.4311377245508983) internal successors, (239), 168 states have internal predecessors, (239), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:35:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 279 transitions. [2024-11-07 10:35:06,847 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 279 transitions. Word has length 127 [2024-11-07 10:35:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:06,847 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 279 transitions. [2024-11-07 10:35:06,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 279 transitions. [2024-11-07 10:35:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 10:35:06,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:06,848 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:06,857 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:35:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:07,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash -774701222, now seen corresponding path program 1 times [2024-11-07 10:35:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402727789] [2024-11-07 10:35:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:07,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:07,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:07,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:35:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 10:35:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:07,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-07 10:35:07,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:11,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:35:11,746 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 53 treesize of output 37 [2024-11-07 10:35:12,140 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 34 treesize of output 22 [2024-11-07 10:35:12,143 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 56 treesize of output 40 [2024-11-07 10:35:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 20 proven. 348 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:35:12,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:35:13,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402727789] [2024-11-07 10:35:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402727789] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:35:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [43] total 49 [2024-11-07 10:35:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970737326] [2024-11-07 10:35:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:13,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:35:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:13,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:35:13,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2186, Unknown=0, NotChecked=0, Total=2352 [2024-11-07 10:35:13,113 INFO L87 Difference]: Start difference. First operand 190 states and 279 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:13,716 INFO L93 Difference]: Finished difference Result 462 states and 673 transitions. [2024-11-07 10:35:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:35:13,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 127 [2024-11-07 10:35:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:13,718 INFO L225 Difference]: With dead ends: 462 [2024-11-07 10:35:13,718 INFO L226 Difference]: Without dead ends: 275 [2024-11-07 10:35:13,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=182, Invalid=2368, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 10:35:13,719 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 156 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:13,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 768 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:35:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-07 10:35:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2024-11-07 10:35:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 164 states have internal predecessors, (234), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:35:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 274 transitions. [2024-11-07 10:35:13,728 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 274 transitions. Word has length 127 [2024-11-07 10:35:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:13,728 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 274 transitions. [2024-11-07 10:35:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 274 transitions. [2024-11-07 10:35:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 10:35:13,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:13,729 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:13,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 10:35:13,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:13,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:13,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1479528241, now seen corresponding path program 1 times [2024-11-07 10:35:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697624758] [2024-11-07 10:35:13,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:13,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:13,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:13,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:35:13,933 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:35:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:14,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 10:35:14,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:14,313 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 17 treesize of output 13 [2024-11-07 10:35:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-07 10:35:14,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:35:14,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:14,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697624758] [2024-11-07 10:35:14,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697624758] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:14,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:35:14,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2024-11-07 10:35:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775307597] [2024-11-07 10:35:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:35:14,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:35:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:35:14,442 INFO L87 Difference]: Start difference. First operand 186 states and 274 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:14,719 INFO L93 Difference]: Finished difference Result 388 states and 567 transitions. [2024-11-07 10:35:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:35:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2024-11-07 10:35:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:14,724 INFO L225 Difference]: With dead ends: 388 [2024-11-07 10:35:14,724 INFO L226 Difference]: Without dead ends: 205 [2024-11-07 10:35:14,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:35:14,725 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 83 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:14,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 782 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:35:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-07 10:35:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 189. [2024-11-07 10:35:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.427710843373494) internal successors, (237), 167 states have internal predecessors, (237), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:35:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2024-11-07 10:35:14,730 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 128 [2024-11-07 10:35:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:14,730 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2024-11-07 10:35:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2024-11-07 10:35:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:35:14,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:14,731 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:14,740 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:35:14,931 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:35:14,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:14,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1972154536, now seen corresponding path program 1 times [2024-11-07 10:35:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:14,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501387961] [2024-11-07 10:35:14,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:14,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:14,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:14,934 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:35:14,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:35:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:15,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 10:35:15,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:16,553 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 33 treesize of output 21 [2024-11-07 10:35:16,556 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:35:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 24 proven. 316 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-07 10:35:16,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:35:17,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:17,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501387961] [2024-11-07 10:35:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501387961] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:35:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27 [2024-11-07 10:35:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149218827] [2024-11-07 10:35:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:17,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:35:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:35:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-07 10:35:17,096 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:17,457 INFO L93 Difference]: Finished difference Result 484 states and 706 transitions. [2024-11-07 10:35:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:35:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-07 10:35:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:17,462 INFO L225 Difference]: With dead ends: 484 [2024-11-07 10:35:17,462 INFO L226 Difference]: Without dead ends: 298 [2024-11-07 10:35:17,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-11-07 10:35:17,463 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 89 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:17,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 500 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:35:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-07 10:35:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 211. [2024-11-07 10:35:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 188 states have (on average 1.446808510638298) internal successors, (272), 189 states have internal predecessors, (272), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:35:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 312 transitions. [2024-11-07 10:35:17,474 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 312 transitions. Word has length 129 [2024-11-07 10:35:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 312 transitions. [2024-11-07 10:35:17,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 312 transitions. [2024-11-07 10:35:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:35:17,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:17,476 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:17,487 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:35:17,676 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:35:17,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1292096166, now seen corresponding path program 1 times [2024-11-07 10:35:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808370937] [2024-11-07 10:35:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:17,680 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:35:17,681 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:35:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:18,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-07 10:35:18,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:35:20,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 37 treesize of output 33 [2024-11-07 10:35:20,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-07 10:35:20,917 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 56 treesize of output 40 [2024-11-07 10:35:20,921 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 34 treesize of output 26 [2024-11-07 10:35:21,069 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 50 treesize of output 34 [2024-11-07 10:35:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 10:35:21,330 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:35:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 10:35:22,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:35:22,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808370937] [2024-11-07 10:35:22,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808370937] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:35:22,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:35:22,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [35] total 41 [2024-11-07 10:35:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954297350] [2024-11-07 10:35:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:35:22,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:35:22,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:35:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:35:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1509, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 10:35:22,456 INFO L87 Difference]: Start difference. First operand 211 states and 312 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:35:23,545 INFO L93 Difference]: Finished difference Result 455 states and 670 transitions. [2024-11-07 10:35:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:35:23,546 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-07 10:35:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:35:23,547 INFO L225 Difference]: With dead ends: 455 [2024-11-07 10:35:23,547 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 10:35:23,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=150, Invalid=1830, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 10:35:23,548 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 74 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:35:23,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 857 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:35:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 10:35:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 211. [2024-11-07 10:35:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 188 states have (on average 1.4414893617021276) internal successors, (271), 189 states have internal predecessors, (271), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:35:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2024-11-07 10:35:23,554 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 129 [2024-11-07 10:35:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:35:23,554 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2024-11-07 10:35:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-07 10:35:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2024-11-07 10:35:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 10:35:23,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:35:23,556 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:35:23,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-07 10:35:23,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:23,756 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:35:23,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:35:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -21990170, now seen corresponding path program 1 times [2024-11-07 10:35:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:35:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061472444] [2024-11-07 10:35:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:35:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:35:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:35:23,759 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:35:23,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-07 10:35:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:35:24,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-07 10:35:24,089 INFO L278 TraceCheckSpWp]: Computing forward predicates...