./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.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-sp_file-57.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', '3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6'] 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-sp_file-57.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 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:57:34,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:57:34,224 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:57:34,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:57:34,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:57:34,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:57:34,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:57:34,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:57:34,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:57:34,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:57:34,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:57:34,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:57:34,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:57:34,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:57:34,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:57:34,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:57:34,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:57:34,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:34,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:57:34,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:57:34,260 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 -> 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 [2024-11-07 10:57:34,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:57:34,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:57:34,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:57:34,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:57:34,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:57:34,505 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-sp_file-57.i [2024-11-07 10:57:35,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:57:36,024 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:57:36,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-07 10:57:36,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a759620f0/f5c95dae3dc84f2c94f8bd0c4527ff2d/FLAGa1ef7e867 [2024-11-07 10:57:36,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a759620f0/f5c95dae3dc84f2c94f8bd0c4527ff2d [2024-11-07 10:57:36,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:57:36,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:57:36,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:36,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:57:36,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:57:36,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c11e92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36, skipping insertion in model container [2024-11-07 10:57:36,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:57:36,151 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-sp_file-57.i[917,930] [2024-11-07 10:57:36,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:36,193 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:57:36,201 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-sp_file-57.i[917,930] [2024-11-07 10:57:36,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:36,233 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:57:36,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36 WrapperNode [2024-11-07 10:57:36,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:36,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:36,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:57:36,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:57:36,239 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:57:36" (1/1) ... [2024-11-07 10:57:36,246 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:57:36" (1/1) ... [2024-11-07 10:57:36,272 INFO L138 Inliner]: procedures = 30, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 427 [2024-11-07 10:57:36,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:36,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:57:36,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:57:36,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:57:36,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,298 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:57:36,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:57:36,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:57:36,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:57:36,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:57:36,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (1/1) ... [2024-11-07 10:57:36,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:36,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:57:36,369 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:57:36,372 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:57:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:57:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:57:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:57:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:57:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:57:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:57:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:57:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:57:36,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:57:36,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:57:36,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:57:36,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:57:36,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:57:36,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:57:36,875 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-07 10:57:36,875 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:57:36,885 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:57:36,886 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:57:36,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:36 BoogieIcfgContainer [2024-11-07 10:57:36,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:57:36,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:57:36,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:57:36,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:57:36,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:57:36" (1/3) ... [2024-11-07 10:57:36,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae53094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:36, skipping insertion in model container [2024-11-07 10:57:36,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:36" (2/3) ... [2024-11-07 10:57:36,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae53094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:36, skipping insertion in model container [2024-11-07 10:57:36,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:36" (3/3) ... [2024-11-07 10:57:36,895 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-07 10:57:36,906 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:57:36,907 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:57:36,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:57:36,959 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;@605c57c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:57:36,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:57:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:57:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:57:36,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:36,974 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:36,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:36,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1864968781, now seen corresponding path program 1 times [2024-11-07 10:57:36,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:36,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219566959] [2024-11-07 10:57:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:37,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:37,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219566959] [2024-11-07 10:57:37,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219566959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:37,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:37,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:57:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333843053] [2024-11-07 10:57:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:37,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:57:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:57:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:57:37,316 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:57:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:37,334 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-07 10:57:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:57:37,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-07 10:57:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:37,340 INFO L225 Difference]: With dead ends: 187 [2024-11-07 10:57:37,340 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:57:37,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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:57:37,344 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:37,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:57:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 10:57:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:57:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-07 10:57:37,391 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-07 10:57:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:37,391 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-07 10:57:37,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:57:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-07 10:57:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:57:37,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:37,394 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:37,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:57:37,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -367330217, now seen corresponding path program 1 times [2024-11-07 10:57:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675570115] [2024-11-07 10:57:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:38,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:38,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675570115] [2024-11-07 10:57:38,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675570115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:38,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:38,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:57:38,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506979496] [2024-11-07 10:57:38,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:38,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:57:38,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:57:38,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:38,318 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:38,575 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2024-11-07 10:57:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-07 10:57:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:38,578 INFO L225 Difference]: With dead ends: 274 [2024-11-07 10:57:38,578 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 10:57:38,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:38,579 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 93 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:38,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 302 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:57:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 10:57:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-07 10:57:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-11-07 10:57:38,610 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134 [2024-11-07 10:57:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:38,610 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-11-07 10:57:38,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-11-07 10:57:38,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:57:38,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:38,612 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:38,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:57:38,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 686354215, now seen corresponding path program 1 times [2024-11-07 10:57:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645314886] [2024-11-07 10:57:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645314886] [2024-11-07 10:57:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645314886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:57:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960677881] [2024-11-07 10:57:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:38,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:57:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:57:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:38,817 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:38,845 INFO L93 Difference]: Finished difference Result 246 states and 357 transitions. [2024-11-07 10:57:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:38,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-07 10:57:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:38,848 INFO L225 Difference]: With dead ends: 246 [2024-11-07 10:57:38,849 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 10:57:38,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:38,850 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:38,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 10:57:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-07 10:57:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 116 states have internal predecessors, (151), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2024-11-07 10:57:38,872 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 141 [2024-11-07 10:57:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:38,874 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2024-11-07 10:57:38,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2024-11-07 10:57:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:57:38,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:38,876 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:38,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:57:38,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 688201257, now seen corresponding path program 1 times [2024-11-07 10:57:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:38,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209311513] [2024-11-07 10:57:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:39,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:39,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209311513] [2024-11-07 10:57:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209311513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:57:39,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974064042] [2024-11-07 10:57:39,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:39,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:57:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:39,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:57:39,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:57:39,983 INFO L87 Difference]: Start difference. First operand 155 states and 223 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:40,498 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2024-11-07 10:57:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:40,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-07 10:57:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:40,501 INFO L225 Difference]: With dead ends: 311 [2024-11-07 10:57:40,501 INFO L226 Difference]: Without dead ends: 219 [2024-11-07 10:57:40,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:57:40,502 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 275 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:40,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 432 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:57:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-07 10:57:40,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 190. [2024-11-07 10:57:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 151 states have internal predecessors, (204), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2024-11-07 10:57:40,525 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 141 [2024-11-07 10:57:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 276 transitions. [2024-11-07 10:57:40,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions. [2024-11-07 10:57:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:57:40,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:40,530 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:40,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:57:40,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash 946366695, now seen corresponding path program 1 times [2024-11-07 10:57:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267999978] [2024-11-07 10:57:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:41,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:41,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267999978] [2024-11-07 10:57:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267999978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:41,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:41,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:57:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108701804] [2024-11-07 10:57:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:41,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:57:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:41,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:57:41,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:57:41,565 INFO L87 Difference]: Start difference. First operand 190 states and 276 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:42,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:42,165 INFO L93 Difference]: Finished difference Result 343 states and 499 transitions. [2024-11-07 10:57:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:57:42,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-07 10:57:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:42,167 INFO L225 Difference]: With dead ends: 343 [2024-11-07 10:57:42,167 INFO L226 Difference]: Without dead ends: 230 [2024-11-07 10:57:42,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:57:42,168 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 208 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:42,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 527 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:57:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-07 10:57:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 180. [2024-11-07 10:57:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 141 states have internal predecessors, (190), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-07 10:57:42,184 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 141 [2024-11-07 10:57:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:42,185 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-07 10:57:42,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-07 10:57:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:57:42,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:42,186 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:42,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:57:42,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:42,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1170047832, now seen corresponding path program 1 times [2024-11-07 10:57:42,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:42,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184042958] [2024-11-07 10:57:42,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:42,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:42,585 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184042958] [2024-11-07 10:57:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184042958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:42,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:42,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:57:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878303977] [2024-11-07 10:57:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:42,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:57:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:57:42,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:42,587 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:42,834 INFO L93 Difference]: Finished difference Result 350 states and 512 transitions. [2024-11-07 10:57:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:57:42,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-07 10:57:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:42,836 INFO L225 Difference]: With dead ends: 350 [2024-11-07 10:57:42,836 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 10:57:42,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:57:42,837 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 230 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:42,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 279 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:57:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 10:57:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 192. [2024-11-07 10:57:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 153 states have internal predecessors, (207), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 279 transitions. [2024-11-07 10:57:42,853 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 279 transitions. Word has length 144 [2024-11-07 10:57:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:42,853 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 279 transitions. [2024-11-07 10:57:42,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 279 transitions. [2024-11-07 10:57:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:57:42,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:42,855 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:42,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:57:42,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:42,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash -824096874, now seen corresponding path program 1 times [2024-11-07 10:57:42,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:42,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023079606] [2024-11-07 10:57:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023079606] [2024-11-07 10:57:44,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023079606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:44,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:44,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:57:44,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675095168] [2024-11-07 10:57:44,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:44,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:57:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:44,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:57:44,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:57:44,450 INFO L87 Difference]: Start difference. First operand 192 states and 279 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 10:57:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:45,053 INFO L93 Difference]: Finished difference Result 411 states and 605 transitions. [2024-11-07 10:57:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2024-11-07 10:57:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:45,056 INFO L225 Difference]: With dead ends: 411 [2024-11-07 10:57:45,056 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 10:57:45,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:57:45,057 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 330 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:45,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 346 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:57:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 10:57:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 221. [2024-11-07 10:57:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 322 transitions. [2024-11-07 10:57:45,076 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 322 transitions. Word has length 144 [2024-11-07 10:57:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:45,076 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 322 transitions. [2024-11-07 10:57:45,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-07 10:57:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 322 transitions. [2024-11-07 10:57:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:57:45,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:45,077 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:45,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:57:45,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:45,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1388902550, now seen corresponding path program 1 times [2024-11-07 10:57:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061004618] [2024-11-07 10:57:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061004618] [2024-11-07 10:57:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061004618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:45,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:45,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529731979] [2024-11-07 10:57:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:45,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:45,399 INFO L87 Difference]: Start difference. First operand 221 states and 322 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:45,628 INFO L93 Difference]: Finished difference Result 404 states and 589 transitions. [2024-11-07 10:57:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:45,628 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-07 10:57:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:45,632 INFO L225 Difference]: With dead ends: 404 [2024-11-07 10:57:45,632 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 10:57:45,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:45,633 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:45,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 370 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:57:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 10:57:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 238. [2024-11-07 10:57:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 199 states have (on average 1.3819095477386936) internal successors, (275), 199 states have internal predecessors, (275), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 347 transitions. [2024-11-07 10:57:45,655 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 347 transitions. Word has length 144 [2024-11-07 10:57:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:45,655 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 347 transitions. [2024-11-07 10:57:45,655 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 347 transitions. [2024-11-07 10:57:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:57:45,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:45,657 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:45,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:57:45,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:45,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2089967128, now seen corresponding path program 1 times [2024-11-07 10:57:45,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:45,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660449327] [2024-11-07 10:57:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660449327] [2024-11-07 10:57:46,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660449327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:46,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:46,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:57:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708051580] [2024-11-07 10:57:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:46,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:57:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:46,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:57:46,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:57:46,392 INFO L87 Difference]: Start difference. First operand 238 states and 347 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:46,787 INFO L93 Difference]: Finished difference Result 463 states and 675 transitions. [2024-11-07 10:57:46,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:46,787 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-07 10:57:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:46,789 INFO L225 Difference]: With dead ends: 463 [2024-11-07 10:57:46,789 INFO L226 Difference]: Without dead ends: 309 [2024-11-07 10:57:46,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:57:46,790 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 163 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:46,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 478 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:57:46,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-07 10:57:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2024-11-07 10:57:46,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 244 states have (on average 1.401639344262295) internal successors, (342), 244 states have internal predecessors, (342), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2024-11-07 10:57:46,807 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 144 [2024-11-07 10:57:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:46,807 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2024-11-07 10:57:46,807 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2024-11-07 10:57:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 10:57:46,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:46,809 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:46,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:57:46,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:46,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:46,809 INFO L85 PathProgramCache]: Analyzing trace with hash 565862395, now seen corresponding path program 1 times [2024-11-07 10:57:46,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:46,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765010130] [2024-11-07 10:57:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:46,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765010130] [2024-11-07 10:57:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765010130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407429561] [2024-11-07 10:57:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:47,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:47,025 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:47,244 INFO L93 Difference]: Finished difference Result 541 states and 791 transitions. [2024-11-07 10:57:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:47,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-07 10:57:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:47,247 INFO L225 Difference]: With dead ends: 541 [2024-11-07 10:57:47,247 INFO L226 Difference]: Without dead ends: 351 [2024-11-07 10:57:47,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:47,250 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 43 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:47,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 420 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:57:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-07 10:57:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 324. [2024-11-07 10:57:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 285 states have (on average 1.4105263157894736) internal successors, (402), 285 states have internal predecessors, (402), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 474 transitions. [2024-11-07 10:57:47,278 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 474 transitions. Word has length 145 [2024-11-07 10:57:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:47,279 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 474 transitions. [2024-11-07 10:57:47,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 474 transitions. [2024-11-07 10:57:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 10:57:47,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:47,280 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:57:47,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:47,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2129346889, now seen corresponding path program 1 times [2024-11-07 10:57:47,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:47,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516468264] [2024-11-07 10:57:47,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516468264] [2024-11-07 10:57:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516468264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:47,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:47,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:47,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557393453] [2024-11-07 10:57:47,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:47,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:47,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:47,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:47,487 INFO L87 Difference]: Start difference. First operand 324 states and 474 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:47,652 INFO L93 Difference]: Finished difference Result 563 states and 821 transitions. [2024-11-07 10:57:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:57:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-07 10:57:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:47,654 INFO L225 Difference]: With dead ends: 563 [2024-11-07 10:57:47,654 INFO L226 Difference]: Without dead ends: 338 [2024-11-07 10:57:47,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:47,655 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 96 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:47,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 365 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:57:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-07 10:57:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 311. [2024-11-07 10:57:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 272 states have (on average 1.3970588235294117) internal successors, (380), 272 states have internal predecessors, (380), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 452 transitions. [2024-11-07 10:57:47,680 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 452 transitions. Word has length 145 [2024-11-07 10:57:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:47,681 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 452 transitions. [2024-11-07 10:57:47,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 452 transitions. [2024-11-07 10:57:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:57:47,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:47,682 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:57:47,683 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:47,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash 131283958, now seen corresponding path program 1 times [2024-11-07 10:57:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525440850] [2024-11-07 10:57:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:48,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:48,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525440850] [2024-11-07 10:57:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525440850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:48,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:48,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:57:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803181290] [2024-11-07 10:57:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:48,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:57:48,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:48,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:57:48,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:57:48,095 INFO L87 Difference]: Start difference. First operand 311 states and 452 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:48,406 INFO L93 Difference]: Finished difference Result 569 states and 824 transitions. [2024-11-07 10:57:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:57:48,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-07 10:57:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:48,408 INFO L225 Difference]: With dead ends: 569 [2024-11-07 10:57:48,409 INFO L226 Difference]: Without dead ends: 357 [2024-11-07 10:57:48,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:57:48,409 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 217 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:48,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 334 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:57:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-07 10:57:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 308. [2024-11-07 10:57:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 269 states have (on average 1.3903345724907064) internal successors, (374), 269 states have internal predecessors, (374), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 446 transitions. [2024-11-07 10:57:48,428 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 446 transitions. Word has length 147 [2024-11-07 10:57:48,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:48,428 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 446 transitions. [2024-11-07 10:57:48,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 446 transitions. [2024-11-07 10:57:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:57:48,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:48,429 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:57:48,429 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1731041970, now seen corresponding path program 1 times [2024-11-07 10:57:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:48,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964854034] [2024-11-07 10:57:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964854034] [2024-11-07 10:57:48,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964854034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:48,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:48,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:57:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29265332] [2024-11-07 10:57:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:48,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:57:48,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:57:48,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:57:48,746 INFO L87 Difference]: Start difference. First operand 308 states and 446 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:49,130 INFO L93 Difference]: Finished difference Result 533 states and 769 transitions. [2024-11-07 10:57:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-07 10:57:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:49,132 INFO L225 Difference]: With dead ends: 533 [2024-11-07 10:57:49,132 INFO L226 Difference]: Without dead ends: 321 [2024-11-07 10:57:49,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:57:49,133 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 128 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:49,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 387 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:57:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-07 10:57:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 286. [2024-11-07 10:57:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 247 states have (on average 1.3805668016194332) internal successors, (341), 247 states have internal predecessors, (341), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 413 transitions. [2024-11-07 10:57:49,150 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 413 transitions. Word has length 147 [2024-11-07 10:57:49,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:49,150 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 413 transitions. [2024-11-07 10:57:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 413 transitions. [2024-11-07 10:57:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:57:49,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:49,151 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:49,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:57:49,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2109166017, now seen corresponding path program 1 times [2024-11-07 10:57:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245183604] [2024-11-07 10:57:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:49,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245183604] [2024-11-07 10:57:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245183604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:49,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:49,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:57:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775512080] [2024-11-07 10:57:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:49,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:57:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:57:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:49,215 INFO L87 Difference]: Start difference. First operand 286 states and 413 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:49,236 INFO L93 Difference]: Finished difference Result 480 states and 694 transitions. [2024-11-07 10:57:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:57:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-07 10:57:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:49,238 INFO L225 Difference]: With dead ends: 480 [2024-11-07 10:57:49,238 INFO L226 Difference]: Without dead ends: 287 [2024-11-07 10:57:49,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:49,239 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:49,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:49,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-07 10:57:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-07 10:57:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 248 states have internal predecessors, (342), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 414 transitions. [2024-11-07 10:57:49,255 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 414 transitions. Word has length 147 [2024-11-07 10:57:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:49,255 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 414 transitions. [2024-11-07 10:57:49,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 414 transitions. [2024-11-07 10:57:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:57:49,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:49,257 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:49,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:57:49,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:49,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1927635841, now seen corresponding path program 1 times [2024-11-07 10:57:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423895471] [2024-11-07 10:57:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 10:57:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 10:57:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:57:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 10:57:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 10:57:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 10:57:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 10:57:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 10:57:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:49,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:49,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423895471] [2024-11-07 10:57:49,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423895471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:57:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017880925] [2024-11-07 10:57:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:49,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:57:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:57:49,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:49,399 INFO L87 Difference]: Start difference. First operand 287 states and 414 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:49,434 INFO L93 Difference]: Finished difference Result 485 states and 699 transitions. [2024-11-07 10:57:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:57:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-07 10:57:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:49,436 INFO L225 Difference]: With dead ends: 485 [2024-11-07 10:57:49,436 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 10:57:49,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:49,437 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:49,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 10:57:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2024-11-07 10:57:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 249 states have (on average 1.3775100401606426) internal successors, (343), 249 states have internal predecessors, (343), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 415 transitions. [2024-11-07 10:57:49,453 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 415 transitions. Word has length 147 [2024-11-07 10:57:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:49,453 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 415 transitions. [2024-11-07 10:57:49,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 415 transitions. [2024-11-07 10:57:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 10:57:49,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:49,455 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:49,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:57:49,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -240080967, now seen corresponding path program 1 times [2024-11-07 10:57:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230403176] [2024-11-07 10:57:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:57:49,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:57:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:57:49,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:57:49,713 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:57:49,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:57:49,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:57:49,717 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:57:49,819 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:57:49,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:57:49 BoogieIcfgContainer [2024-11-07 10:57:49,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:57:49,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:57:49,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:57:49,823 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:57:49,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:36" (3/4) ... [2024-11-07 10:57:49,825 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:57:49,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:57:49,826 INFO L158 Benchmark]: Toolchain (without parser) took 13776.73ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 85.1MB in the beginning and 323.3MB in the end (delta: -238.2MB). Peak memory consumption was 272.8MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,826 INFO L158 Benchmark]: CDTParser took 3.79ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.40ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 69.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.46ms. Allocated memory is still 109.1MB. Free memory was 69.8MB in the beginning and 66.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,829 INFO L158 Benchmark]: Boogie Preprocessor took 62.82ms. Allocated memory is still 109.1MB. Free memory was 66.9MB in the beginning and 64.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,829 INFO L158 Benchmark]: RCFGBuilder took 550.66ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 79.2MB in the end (delta: -14.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,829 INFO L158 Benchmark]: TraceAbstraction took 12933.64ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 78.6MB in the beginning and 323.4MB in the end (delta: -244.8MB). Peak memory consumption was 268.1MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,830 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 620.8MB. Free memory was 323.4MB in the beginning and 323.3MB in the end (delta: 105.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,830 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.79ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.40ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 69.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.46ms. Allocated memory is still 109.1MB. Free memory was 69.8MB in the beginning and 66.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.82ms. Allocated memory is still 109.1MB. Free memory was 66.9MB in the beginning and 64.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 550.66ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 79.2MB in the end (delta: -14.9MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12933.64ms. Allocated memory was 109.1MB in the beginning and 620.8MB in the end (delta: 511.7MB). Free memory was 78.6MB in the beginning and 323.4MB in the end (delta: -244.8MB). Peak memory consumption was 268.1MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 620.8MB. Free memory was 323.4MB in the beginning and 323.3MB in the end (delta: 105.4kB). 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 132. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L53] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L54] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L55] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] signed char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L58] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] signed char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L60] signed char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] signed char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L64] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L65] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L66] signed char last_1_WrapperStruct00_var_1_9 = 64; [L67] signed char last_1_WrapperStruct00_var_1_14 = -64; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=0, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_9 [L128] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L129] EXPR WrapperStruct00.var_1_14 [L129] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L114] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L117] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L140] RET updateVariables() [L141] CALL step() [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L72] COND TRUE ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9) [L73] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L73] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=-255] [L73] COND TRUE ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && stepLocal_0 [L74] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] EXPR ((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] signed long int stepLocal_3 = ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))); [L82] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_3=0] [L82] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) < stepLocal_3 [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L83] (*(WrapperStruct00_var_1_14_Pointer)) = ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))) [L87] (*(WrapperStruct00_var_1_17_Pointer)) = 128.91f [L88] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)); [L89] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L89] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_5_Pointer)); [L90] stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_2=0] [L90] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L95] (*(WrapperStruct00_var_1_9_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))) [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer)) [L132] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L132] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) [L132] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) [L132] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L132] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132-L133] return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 16, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1823 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1822 mSDsluCounter, 5667 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3829 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3191 IncrementalHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1838 mSDtfsCounter, 3191 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 598 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=10, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 409 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2292 NumberOfCodeBlocks, 2292 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2130 ConstructedInterpolants, 0 QuantifiedInterpolants, 10150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 9180/9180 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:57:49,863 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-sp_file-57.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 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:57:51,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:57:51,792 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:57:51,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:57:51,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:57:51,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:57:51,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:57:51,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:57:51,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:57:51,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:57:51,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:57:51,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:57:51,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:57:51,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:57:51,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:57:51,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:51,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:57:51,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:57:51,864 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 -> 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 [2024-11-07 10:57:52,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:57:52,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:57:52,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:57:52,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:57:52,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:57:52,163 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-sp_file-57.i [2024-11-07 10:57:53,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:57:53,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:57:53,607 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-07 10:57:53,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afd7dfa5f/fa0df21b332b406cbcd170ac3ce33e39/FLAG8a073c7fb [2024-11-07 10:57:53,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afd7dfa5f/fa0df21b332b406cbcd170ac3ce33e39 [2024-11-07 10:57:53,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:57:53,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:57:53,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:53,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:57:53,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:57:53,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550f34e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53, skipping insertion in model container [2024-11-07 10:57:53,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:57:53,763 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-sp_file-57.i[917,930] [2024-11-07 10:57:53,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:53,837 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:57:53,846 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-sp_file-57.i[917,930] [2024-11-07 10:57:53,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:53,904 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:57:53,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53 WrapperNode [2024-11-07 10:57:53,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:53,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:53,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:57:53,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:57:53,912 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:57:53" (1/1) ... [2024-11-07 10:57:53,926 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:57:53" (1/1) ... [2024-11-07 10:57:53,958 INFO L138 Inliner]: procedures = 34, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 420 [2024-11-07 10:57:53,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:53,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:57:53,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:57:53,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:57:53,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,994 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-07 10:57:53,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,008 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:57:54,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:57:54,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:57:54,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:57:54,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:57:54,038 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:57:54,041 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:57:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:57:54,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:57:54,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:57:54,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:57:54,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:57:54,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:57:54,165 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:57:54,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:57:54,662 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-07 10:57:54,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:57:54,678 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:57:54,679 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:57:54,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:54 BoogieIcfgContainer [2024-11-07 10:57:54,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:57:54,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:57:54,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:57:54,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:57:54,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:57:53" (1/3) ... [2024-11-07 10:57:54,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d712e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:54, skipping insertion in model container [2024-11-07 10:57:54,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53" (2/3) ... [2024-11-07 10:57:54,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d712e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:54, skipping insertion in model container [2024-11-07 10:57:54,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:54" (3/3) ... [2024-11-07 10:57:54,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-07 10:57:54,698 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:57:54,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:57:54,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:57:54,752 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;@39d02179, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:57:54,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:57:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:57:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:57:54,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:54,764 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:54,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:54,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1840313941, now seen corresponding path program 1 times [2024-11-07 10:57:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:57:54,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064077237] [2024-11-07 10:57:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:54,776 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:57:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:57:54,779 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:57:54,781 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:57:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:54,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:57:54,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:57:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-07 10:57:55,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:57:55,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:57:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064077237] [2024-11-07 10:57:55,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064077237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:55,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:55,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:57:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507568310] [2024-11-07 10:57:55,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:57:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:57:55,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:57:55,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:57:55,039 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:57:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:55,056 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-07 10:57:55,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:57:55,058 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-07 10:57:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:55,062 INFO L225 Difference]: With dead ends: 187 [2024-11-07 10:57:55,062 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 10:57:55,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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:57:55,066 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:55,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:55,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 10:57:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 10:57:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:57:55,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-07 10:57:55,092 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-07 10:57:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:55,092 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-07 10:57:55,093 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:57:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-07 10:57:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:57:55,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:55,096 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:55,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 10:57:55,300 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:57:55,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:55,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash -957014791, now seen corresponding path program 1 times [2024-11-07 10:57:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:57:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487264370] [2024-11-07 10:57:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:55,306 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:57:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:57:55,313 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:57:55,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 (3)] Waiting until timeout for monitored process [2024-11-07 10:57:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:55,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:57:55,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:57:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:55,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:57:55,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:57:55,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487264370] [2024-11-07 10:57:55,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487264370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:55,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:55,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266156145] [2024-11-07 10:57:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:55,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:57:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:55,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:55,631 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:55,692 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2024-11-07 10:57:55,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:55,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-07 10:57:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:55,696 INFO L225 Difference]: With dead ends: 188 [2024-11-07 10:57:55,696 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 10:57:55,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:55,697 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:55,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 507 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 10:57:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-07 10:57:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:57:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-07 10:57:55,715 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 134 [2024-11-07 10:57:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:55,717 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-07 10:57:55,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-07 10:57:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 10:57:55,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:55,721 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:55,735 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:57:55,921 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:57:55,922 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -955167749, now seen corresponding path program 1 times [2024-11-07 10:57:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:57:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831530575] [2024-11-07 10:57:55,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:55,923 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:57:55,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:57:55,927 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:57:55,929 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:57:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:56,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 10:57:56,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:57:56,231 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 72 treesize of output 71 [2024-11-07 10:57:56,366 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 156 treesize of output 128 [2024-11-07 10:57:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:57:56,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:57:56,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:57:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831530575] [2024-11-07 10:57:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831530575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:56,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:57:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447264718] [2024-11-07 10:57:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:56,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:57:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:57:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:57:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:56,893 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:58,585 INFO L93 Difference]: Finished difference Result 286 states and 412 transitions. [2024-11-07 10:57:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-07 10:57:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:58,588 INFO L225 Difference]: With dead ends: 286 [2024-11-07 10:57:58,588 INFO L226 Difference]: Without dead ends: 192 [2024-11-07 10:57:58,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:58,590 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 82 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:58,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 301 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 10:57:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-07 10:57:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2024-11-07 10:57:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 118 states have (on average 1.2966101694915255) internal successors, (153), 118 states have internal predecessors, (153), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-11-07 10:57:58,613 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 134 [2024-11-07 10:57:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:58,614 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-11-07 10:57:58,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:57:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-11-07 10:57:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:57:58,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:58,615 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:58,623 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:57:58,816 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:57:58,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:58,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:58,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1705869233, now seen corresponding path program 1 times [2024-11-07 10:57:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:57:58,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821596478] [2024-11-07 10:57:58,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:58,818 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:57:58,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:57:58,820 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:57:58,824 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:57:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:59,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 10:57:59,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:57:59,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:57:59,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:58:00,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 10:58:00,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-07 10:58:00,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-07 10:58:01,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-07 10:58:02,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-07 10:58:02,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-07 10:58:03,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-07 10:58:03,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 71 [2024-11-07 10:58:03,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 121 [2024-11-07 10:58:03,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-07 10:58:04,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 117 [2024-11-07 10:58:04,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:04,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 146 treesize of output 117 [2024-11-07 10:58:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 361 proven. 170 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-07 10:58:04,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:58:08,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:08,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821596478] [2024-11-07 10:58:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821596478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:58:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [889957151] [2024-11-07 10:58:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:08,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:58:08,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:58:08,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:58:08,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-07 10:58:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:08,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 10:58:08,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:10,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-07 10:58:10,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-11-07 10:58:10,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-11-07 10:58:11,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-07 10:58:11,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-07 10:58:11,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-07 10:58:11,621 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 97 treesize of output 73 [2024-11-07 10:58:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:58:11,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:11,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [889957151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:11,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:58:11,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 24 [2024-11-07 10:58:11,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245148572] [2024-11-07 10:58:11,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:11,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:58:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:58:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:58:11,811 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:12,734 INFO L93 Difference]: Finished difference Result 317 states and 457 transitions. [2024-11-07 10:58:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:58:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-07 10:58:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:12,737 INFO L225 Difference]: With dead ends: 317 [2024-11-07 10:58:12,742 INFO L226 Difference]: Without dead ends: 223 [2024-11-07 10:58:12,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 10:58:12,743 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:12,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 432 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:58:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-07 10:58:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 192. [2024-11-07 10:58:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.34640522875817) internal successors, (206), 153 states have internal predecessors, (206), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:58:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 278 transitions. [2024-11-07 10:58:12,789 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 278 transitions. Word has length 141 [2024-11-07 10:58:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 278 transitions. [2024-11-07 10:58:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 278 transitions. [2024-11-07 10:58:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:58:12,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:12,798 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:12,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-07 10:58:13,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:13,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:58:13,199 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:13,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1447703795, now seen corresponding path program 1 times [2024-11-07 10:58:13,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:13,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546051915] [2024-11-07 10:58:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:13,200 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:58:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:13,205 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:58:13,206 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:58:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:13,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 10:58:13,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:13,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:58:13,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-07 10:58:14,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-07 10:58:14,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-07 10:58:15,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-07 10:58:15,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-07 10:58:16,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-07 10:58:16,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2024-11-07 10:58:17,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2024-11-07 10:58:18,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 89 [2024-11-07 10:58:18,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 163 [2024-11-07 10:58:18,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2024-11-07 10:58:19,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 162 [2024-11-07 10:58:19,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:19,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 194 treesize of output 162 [2024-11-07 10:58:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 393 proven. 170 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-07 10:58:20,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:58:23,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:23,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546051915] [2024-11-07 10:58:23,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546051915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:58:23,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1501563981] [2024-11-07 10:58:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:58:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:58:23,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:58:23,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-07 10:58:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:24,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 10:58:24,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:26,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-07 10:58:26,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-11-07 10:58:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2024-11-07 10:58:26,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-07 10:58:26,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-07 10:58:26,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-11-07 10:58:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:58:27,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1501563981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:58:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2024-11-07 10:58:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399168892] [2024-11-07 10:58:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:58:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:58:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 10:58:27,185 INFO L87 Difference]: Start difference. First operand 192 states and 278 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:28,438 INFO L93 Difference]: Finished difference Result 366 states and 527 transitions. [2024-11-07 10:58:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:58:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-07 10:58:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:28,444 INFO L225 Difference]: With dead ends: 366 [2024-11-07 10:58:28,444 INFO L226 Difference]: Without dead ends: 251 [2024-11-07 10:58:28,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 10:58:28,447 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 438 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:28,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 525 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:58:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-07 10:58:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 192. [2024-11-07 10:58:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.34640522875817) internal successors, (206), 153 states have internal predecessors, (206), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:58:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 278 transitions. [2024-11-07 10:58:28,480 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 278 transitions. Word has length 141 [2024-11-07 10:58:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:28,481 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 278 transitions. [2024-11-07 10:58:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 278 transitions. [2024-11-07 10:58:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 10:58:28,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:28,485 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:28,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:28,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:58:28,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1565320623, now seen corresponding path program 1 times [2024-11-07 10:58:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599796199] [2024-11-07 10:58:28,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:28,887 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:58:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:28,890 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:58:28,891 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:58:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:29,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 10:58:29,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:29,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:58:29,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-07 10:58:30,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:58:30,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:58:31,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:58:31,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-07 10:58:31,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-07 10:58:32,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2024-11-07 10:58:33,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-07 10:58:33,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-07 10:58:34,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-07 10:58:34,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:34,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 61 [2024-11-07 10:58:34,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:34,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 36 [2024-11-07 10:58:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 297 proven. 170 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-07 10:58:34,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:58:34,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599796199] [2024-11-07 10:58:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599796199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:58:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [999904957] [2024-11-07 10:58:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:34,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:58:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:58:34,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:58:34,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-07 10:58:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:35,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 10:58:35,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:37,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:58:37,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 10:58:37,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 10:58:37,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 10:58:37,561 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 69 treesize of output 57 [2024-11-07 10:58:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:58:37,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [999904957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:58:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2024-11-07 10:58:37,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6577648] [2024-11-07 10:58:37,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:37,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:58:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:37,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:58:37,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 10:58:37,685 INFO L87 Difference]: Start difference. First operand 192 states and 278 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:38,936 INFO L93 Difference]: Finished difference Result 363 states and 524 transitions. [2024-11-07 10:58:38,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:58:38,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-07 10:58:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:38,938 INFO L225 Difference]: With dead ends: 363 [2024-11-07 10:58:38,938 INFO L226 Difference]: Without dead ends: 248 [2024-11-07 10:58:38,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 10:58:38,939 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 200 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:38,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 715 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 10:58:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-07 10:58:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 173. [2024-11-07 10:58:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 134 states have internal predecessors, (177), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:58:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 249 transitions. [2024-11-07 10:58:38,957 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 249 transitions. Word has length 141 [2024-11-07 10:58:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:38,957 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 249 transitions. [2024-11-07 10:58:38,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 249 transitions. [2024-11-07 10:58:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:58:38,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:38,958 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:38,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:39,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-07 10:58:39,359 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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 10:58:39,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:39,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1643005562, now seen corresponding path program 1 times [2024-11-07 10:58:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:39,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830614652] [2024-11-07 10:58:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:39,361 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:58:39,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:39,366 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:58:39,367 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:58:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:39,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:58:39,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:58:39,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:39,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830614652] [2024-11-07 10:58:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830614652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:58:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993867908] [2024-11-07 10:58:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:58:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:58:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:58:39,558 INFO L87 Difference]: Start difference. First operand 173 states and 249 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:39,953 INFO L93 Difference]: Finished difference Result 317 states and 456 transitions. [2024-11-07 10:58:39,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:58:39,954 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-07 10:58:39,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:39,955 INFO L225 Difference]: With dead ends: 317 [2024-11-07 10:58:39,956 INFO L226 Difference]: Without dead ends: 207 [2024-11-07 10:58:39,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:58:39,956 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 38 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:39,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 362 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:58:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-07 10:58:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2024-11-07 10:58:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 142 states have (on average 1.323943661971831) internal successors, (188), 142 states have internal predecessors, (188), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:58:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2024-11-07 10:58:39,988 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 144 [2024-11-07 10:58:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:39,988 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2024-11-07 10:58:39,989 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2024-11-07 10:58:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:58:39,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:39,989 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:39,997 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:58:40,190 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:58:40,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1950897156, now seen corresponding path program 1 times [2024-11-07 10:58:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477137876] [2024-11-07 10:58:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:40,192 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:58:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:40,193 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:58:40,195 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:58:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:40,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 10:58:40,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:40,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:58:40,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-07 10:58:41,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-07 10:58:41,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-07 10:58:42,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-07 10:58:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-11-07 10:58:43,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-07 10:58:44,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2024-11-07 10:58:44,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2024-11-07 10:58:45,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 89 [2024-11-07 10:58:45,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 163 [2024-11-07 10:58:45,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 67 [2024-11-07 10:58:46,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 162 [2024-11-07 10:58:46,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:46,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 194 treesize of output 162 [2024-11-07 10:58:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 393 proven. 170 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-07 10:58:47,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:58:50,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477137876] [2024-11-07 10:58:50,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477137876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:58:50,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [208626560] [2024-11-07 10:58:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:50,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:58:50,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:58:50,782 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:58:50,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-07 10:58:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:51,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 10:58:51,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:51,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-07 10:58:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:58:52,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:52,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [208626560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:52,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:58:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2024-11-07 10:58:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423453331] [2024-11-07 10:58:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:52,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:58:52,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:52,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:58:52,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2024-11-07 10:58:52,103 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:52,573 INFO L93 Difference]: Finished difference Result 346 states and 497 transitions. [2024-11-07 10:58:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:58:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-07 10:58:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:52,575 INFO L225 Difference]: With dead ends: 346 [2024-11-07 10:58:52,575 INFO L226 Difference]: Without dead ends: 228 [2024-11-07 10:58:52,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2024-11-07 10:58:52,576 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 159 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:52,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 277 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:58:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-07 10:58:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 191. [2024-11-07 10:58:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 152 states have internal predecessors, (203), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:58:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 275 transitions. [2024-11-07 10:58:52,592 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 275 transitions. Word has length 144 [2024-11-07 10:58:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:52,592 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 275 transitions. [2024-11-07 10:58:52,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:58:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 275 transitions. [2024-11-07 10:58:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 10:58:52,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:52,593 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:52,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:52,801 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:58:52,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:58:52,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -351139144, now seen corresponding path program 1 times [2024-11-07 10:58:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:52,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713750036] [2024-11-07 10:58:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:52,998 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:58:52,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:53,002 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:58:53,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-07 10:58:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:53,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 10:58:53,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:53,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 10:58:53,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-07 10:58:54,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-07 10:58:54,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-07 10:58:54,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-07 10:58:55,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-07 10:58:55,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-07 10:58:56,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-07 10:58:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-07 10:58:57,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 65 [2024-11-07 10:58:57,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 107 [2024-11-07 10:58:57,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2024-11-07 10:58:57,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 102 [2024-11-07 10:58:58,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:58,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 130 treesize of output 102 [2024-11-07 10:58:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 233 proven. 170 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-07 10:58:58,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:59:01,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:59:01,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713750036] [2024-11-07 10:59:01,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713750036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:59:01,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [868135722] [2024-11-07 10:59:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:59:01,914 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:59:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:59:01,918 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 10:59:01,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-07 10:59:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:59:02,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 10:59:02,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:59:02,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-07 10:59:03,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-07 10:59:03,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-07 10:59:04,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-07 10:59:04,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-07 10:59:05,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42