./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.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-21.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', 'abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3'] 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-21.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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:53:25,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:53:26,089 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:53:26,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:53:26,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:53:26,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:53:26,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:53:26,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:53:26,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:53:26,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:53:26,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:53:26,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:53:26,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:53:26,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:53:26,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:53:26,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:53:26,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:53:26,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:53:26,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:53:26,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:53:26,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:53:26,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:53:26,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:53:26,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:53:26,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:26,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:53:26,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:53:26,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:53:26,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:53:26,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:53:26,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:53:26,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:53:26,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:53:26,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:53:26,138 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-11-07 10:53:26,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:53:26,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:53:26,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:53:26,383 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:53:26,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:53:26,384 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-21.i [2024-11-07 10:53:27,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:53:27,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:53:27,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-07 10:53:27,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/272df50b3/f5c0d4ceeb7143eda0bd6a378e475388/FLAG96e5a9a2a [2024-11-07 10:53:27,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/272df50b3/f5c0d4ceeb7143eda0bd6a378e475388 [2024-11-07 10:53:27,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:53:27,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:53:27,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:27,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:53:27,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:53:27,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:27" (1/1) ... [2024-11-07 10:53:27,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb777ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:27, skipping insertion in model container [2024-11-07 10:53:27,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:27" (1/1) ... [2024-11-07 10:53:27,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:53:28,051 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-21.i[917,930] [2024-11-07 10:53:28,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:28,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:53:28,112 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-21.i[917,930] [2024-11-07 10:53:28,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:28,149 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:53:28,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28 WrapperNode [2024-11-07 10:53:28,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:28,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:28,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:53:28,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:53:28,155 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:53:28" (1/1) ... [2024-11-07 10:53:28,165 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:53:28" (1/1) ... [2024-11-07 10:53:28,185 INFO L138 Inliner]: procedures = 29, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-11-07 10:53:28,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:28,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:53:28,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:53:28,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:53:28,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,220 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-07 10:53:28,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:53:28,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:53:28,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:53:28,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:53:28,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (1/1) ... [2024-11-07 10:53:28,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:28,277 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:53:28,282 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:53:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:53:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-07 10:53:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-07 10:53:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-07 10:53:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-07 10:53:28,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:53:28,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:53:28,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 10:53:28,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:53:28,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:53:28,395 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:53:28,396 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:53:28,733 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-07 10:53:28,733 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:53:28,742 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:53:28,742 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:53:28,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:28 BoogieIcfgContainer [2024-11-07 10:53:28,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:53:28,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:53:28,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:53:28,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:53:28,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:53:27" (1/3) ... [2024-11-07 10:53:28,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e2ea09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:28, skipping insertion in model container [2024-11-07 10:53:28,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:28" (2/3) ... [2024-11-07 10:53:28,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e2ea09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:28, skipping insertion in model container [2024-11-07 10:53:28,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:28" (3/3) ... [2024-11-07 10:53:28,751 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-07 10:53:28,760 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:53:28,761 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:53:28,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:53:28,808 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;@10441541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:53:28,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:53:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:53:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:53:28,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:28,817 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:28,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 306818116, now seen corresponding path program 1 times [2024-11-07 10:53:28,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192128829] [2024-11-07 10:53:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192128829] [2024-11-07 10:53:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192128829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:29,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:53:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961496060] [2024-11-07 10:53:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:29,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:53:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:53:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:29,066 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:53:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:29,089 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-07 10:53:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:53:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-07 10:53:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:29,096 INFO L225 Difference]: With dead ends: 185 [2024-11-07 10:53:29,096 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:53:29,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:53:29,102 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:53:29,103 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:53:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:53:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 10:53:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:53:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-07 10:53:29,136 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-11-07 10:53:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:29,137 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-07 10:53:29,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:53:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-07 10:53:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:53:29,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:29,140 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:29,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:53:29,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:29,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1397824002, now seen corresponding path program 1 times [2024-11-07 10:53:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013281437] [2024-11-07 10:53:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013281437] [2024-11-07 10:53:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013281437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:30,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:30,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:53:30,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716700078] [2024-11-07 10:53:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:30,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:53:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:53:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:30,110 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:30,539 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2024-11-07 10:53:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:53:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-11-07 10:53:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:30,541 INFO L225 Difference]: With dead ends: 301 [2024-11-07 10:53:30,543 INFO L226 Difference]: Without dead ends: 212 [2024-11-07 10:53:30,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:30,545 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 195 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:30,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 706 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:53:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-07 10:53:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2024-11-07 10:53:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 168 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:53:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2024-11-07 10:53:30,562 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 80 [2024-11-07 10:53:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:30,563 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2024-11-07 10:53:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2024-11-07 10:53:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 10:53:30,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:30,566 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:53:30,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:30,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash 986714953, now seen corresponding path program 1 times [2024-11-07 10:53:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:30,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531935532] [2024-11-07 10:53:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:30,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:30,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531935532] [2024-11-07 10:53:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531935532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034416842] [2024-11-07 10:53:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:53:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:30,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:53:30,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:30,730 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:30,764 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2024-11-07 10:53:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:53:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-11-07 10:53:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:30,767 INFO L225 Difference]: With dead ends: 370 [2024-11-07 10:53:30,768 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:53:30,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:53:30,769 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:30,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:30,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:53:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 10:53:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:53:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2024-11-07 10:53:30,789 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 83 [2024-11-07 10:53:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:30,789 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2024-11-07 10:53:30,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2024-11-07 10:53:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 10:53:30,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:30,791 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:30,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:53:30,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:30,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -863945486, now seen corresponding path program 1 times [2024-11-07 10:53:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521622453] [2024-11-07 10:53:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521622453] [2024-11-07 10:53:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521622453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:31,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:31,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:53:31,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052870806] [2024-11-07 10:53:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:31,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:53:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:31,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:53:31,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:53:31,857 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 10:53:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:32,479 INFO L93 Difference]: Finished difference Result 412 states and 590 transitions. [2024-11-07 10:53:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 10:53:32,480 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 87 [2024-11-07 10:53:32,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:32,481 INFO L225 Difference]: With dead ends: 412 [2024-11-07 10:53:32,481 INFO L226 Difference]: Without dead ends: 320 [2024-11-07 10:53:32,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-07 10:53:32,482 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 504 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:32,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 936 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:53:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-07 10:53:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 296. [2024-11-07 10:53:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 271 states have (on average 1.4206642066420665) internal successors, (385), 273 states have internal predecessors, (385), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 425 transitions. [2024-11-07 10:53:32,500 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 425 transitions. Word has length 87 [2024-11-07 10:53:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:32,500 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 425 transitions. [2024-11-07 10:53:32,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 10:53:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 425 transitions. [2024-11-07 10:53:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 10:53:32,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:32,502 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:32,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:53:32,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:32,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash -907307414, now seen corresponding path program 1 times [2024-11-07 10:53:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:32,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497858698] [2024-11-07 10:53:32,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:32,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497858698] [2024-11-07 10:53:33,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497858698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:33,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:33,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:53:33,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581103897] [2024-11-07 10:53:33,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:33,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:53:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:33,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:53:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:53:33,396 INFO L87 Difference]: Start difference. First operand 296 states and 425 transitions. Second operand has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 10:53:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:33,723 INFO L93 Difference]: Finished difference Result 545 states and 777 transitions. [2024-11-07 10:53:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:53:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) Word has length 88 [2024-11-07 10:53:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:33,726 INFO L225 Difference]: With dead ends: 545 [2024-11-07 10:53:33,726 INFO L226 Difference]: Without dead ends: 374 [2024-11-07 10:53:33,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 10:53:33,727 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 182 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:33,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 584 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:53:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-07 10:53:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 316. [2024-11-07 10:53:33,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 291 states have (on average 1.4123711340206186) internal successors, (411), 293 states have internal predecessors, (411), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 451 transitions. [2024-11-07 10:53:33,746 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 451 transitions. Word has length 88 [2024-11-07 10:53:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:33,746 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 451 transitions. [2024-11-07 10:53:33,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.222222222222222) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 10:53:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 451 transitions. [2024-11-07 10:53:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:53:33,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:33,747 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:53:33,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash -438132547, now seen corresponding path program 1 times [2024-11-07 10:53:33,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:33,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328148707] [2024-11-07 10:53:33,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:33,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:33,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:33,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328148707] [2024-11-07 10:53:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328148707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:33,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:33,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:53:33,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248648915] [2024-11-07 10:53:33,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:33,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:53:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:53:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:33,881 INFO L87 Difference]: Start difference. First operand 316 states and 451 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:33,921 INFO L93 Difference]: Finished difference Result 330 states and 467 transitions. [2024-11-07 10:53:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:53:33,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2024-11-07 10:53:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:33,923 INFO L225 Difference]: With dead ends: 330 [2024-11-07 10:53:33,923 INFO L226 Difference]: Without dead ends: 328 [2024-11-07 10:53:33,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:33,924 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:33,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-07 10:53:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-11-07 10:53:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 303 states have (on average 1.396039603960396) internal successors, (423), 305 states have internal predecessors, (423), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 10:53:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 463 transitions. [2024-11-07 10:53:33,939 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 463 transitions. Word has length 89 [2024-11-07 10:53:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:33,939 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 463 transitions. [2024-11-07 10:53:33,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 463 transitions. [2024-11-07 10:53:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:53:33,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:33,940 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:33,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:53:33,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:33,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash -510286070, now seen corresponding path program 1 times [2024-11-07 10:53:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:33,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536182068] [2024-11-07 10:53:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:33,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536182068] [2024-11-07 10:53:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536182068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:34,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:34,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 10:53:34,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746408718] [2024-11-07 10:53:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:34,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 10:53:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 10:53:34,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:53:34,417 INFO L87 Difference]: Start difference. First operand 328 states and 463 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:53:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:34,873 INFO L93 Difference]: Finished difference Result 837 states and 1170 transitions. [2024-11-07 10:53:34,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 10:53:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-07 10:53:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:34,876 INFO L225 Difference]: With dead ends: 837 [2024-11-07 10:53:34,877 INFO L226 Difference]: Without dead ends: 534 [2024-11-07 10:53:34,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:53:34,879 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 184 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:34,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 951 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:53:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-07 10:53:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 432. [2024-11-07 10:53:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 398 states have (on average 1.3919597989949748) internal successors, (554), 400 states have internal predecessors, (554), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:53:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 608 transitions. [2024-11-07 10:53:34,910 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 608 transitions. Word has length 89 [2024-11-07 10:53:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 608 transitions. [2024-11-07 10:53:34,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:53:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 608 transitions. [2024-11-07 10:53:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:53:34,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:34,912 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:53:34,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:34,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:34,913 INFO L85 PathProgramCache]: Analyzing trace with hash -827246940, now seen corresponding path program 1 times [2024-11-07 10:53:34,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:34,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153609985] [2024-11-07 10:53:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153609985] [2024-11-07 10:53:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153609985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:35,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:35,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:53:35,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915473604] [2024-11-07 10:53:35,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:35,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:53:35,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:35,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:53:35,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:53:35,049 INFO L87 Difference]: Start difference. First operand 432 states and 608 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:35,269 INFO L93 Difference]: Finished difference Result 969 states and 1360 transitions. [2024-11-07 10:53:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:53:35,269 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-07 10:53:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:35,271 INFO L225 Difference]: With dead ends: 969 [2024-11-07 10:53:35,271 INFO L226 Difference]: Without dead ends: 562 [2024-11-07 10:53:35,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:35,273 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 194 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:35,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 455 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:53:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-07 10:53:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 509. [2024-11-07 10:53:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 475 states have (on average 1.3936842105263159) internal successors, (662), 477 states have internal predecessors, (662), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:53:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 716 transitions. [2024-11-07 10:53:35,308 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 716 transitions. Word has length 90 [2024-11-07 10:53:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:35,308 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 716 transitions. [2024-11-07 10:53:35,309 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 716 transitions. [2024-11-07 10:53:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:53:35,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:35,309 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:53:35,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:35,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:35,310 INFO L85 PathProgramCache]: Analyzing trace with hash -540215580, now seen corresponding path program 1 times [2024-11-07 10:53:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658565013] [2024-11-07 10:53:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:35,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658565013] [2024-11-07 10:53:35,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658565013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:35,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:35,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:53:35,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022395133] [2024-11-07 10:53:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:35,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:53:35,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:53:35,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:35,432 INFO L87 Difference]: Start difference. First operand 509 states and 716 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:35,487 INFO L93 Difference]: Finished difference Result 1003 states and 1408 transitions. [2024-11-07 10:53:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:53:35,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-07 10:53:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:35,492 INFO L225 Difference]: With dead ends: 1003 [2024-11-07 10:53:35,492 INFO L226 Difference]: Without dead ends: 519 [2024-11-07 10:53:35,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:53:35,494 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:35,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 885 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-07 10:53:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 507. [2024-11-07 10:53:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 473 states have (on average 1.3932346723044398) internal successors, (659), 475 states have internal predecessors, (659), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:53:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 713 transitions. [2024-11-07 10:53:35,522 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 713 transitions. Word has length 90 [2024-11-07 10:53:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:35,523 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 713 transitions. [2024-11-07 10:53:35,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 713 transitions. [2024-11-07 10:53:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:53:35,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:35,524 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:53:35,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:35,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:35,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1938045312, now seen corresponding path program 1 times [2024-11-07 10:53:35,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:35,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033855283] [2024-11-07 10:53:35,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:35,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 10:53:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:53:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 10:53:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:53:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:53:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 10:53:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 10:53:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:35,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:53:35,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033855283] [2024-11-07 10:53:35,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033855283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:35,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:35,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:53:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30826440] [2024-11-07 10:53:35,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:35,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:53:35,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:53:35,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:53:35,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:53:35,576 INFO L87 Difference]: Start difference. First operand 507 states and 713 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:35,599 INFO L93 Difference]: Finished difference Result 892 states and 1262 transitions. [2024-11-07 10:53:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:53:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2024-11-07 10:53:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:35,615 INFO L225 Difference]: With dead ends: 892 [2024-11-07 10:53:35,615 INFO L226 Difference]: Without dead ends: 514 [2024-11-07 10:53:35,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:53:35,615 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:53:35,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:53:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-07 10:53:35,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-11-07 10:53:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 480 states have (on average 1.3875) internal successors, (666), 482 states have internal predecessors, (666), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 10:53:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 720 transitions. [2024-11-07 10:53:35,641 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 720 transitions. Word has length 90 [2024-11-07 10:53:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:35,641 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 720 transitions. [2024-11-07 10:53:35,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 720 transitions. [2024-11-07 10:53:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 10:53:35,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:35,642 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:53:35,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:35,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash 768574082, now seen corresponding path program 1 times [2024-11-07 10:53:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:53:35,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595064700] [2024-11-07 10:53:35,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:53:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 10:53:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526155264] [2024-11-07 10:53:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:53:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:35,682 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 10:53:35,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 10:53:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:53:35,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:53:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:53:35,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:53:35,982 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:53:35,983 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:53:36,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 10:53:36,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 10:53:36,188 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:53:36,288 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:53:36,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:53:36 BoogieIcfgContainer [2024-11-07 10:53:36,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:53:36,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:53:36,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:53:36,291 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:53:36,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:28" (3/4) ... [2024-11-07 10:53:36,299 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:53:36,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:53:36,304 INFO L158 Benchmark]: Toolchain (without parser) took 8374.11ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 77.1MB in the beginning and 234.7MB in the end (delta: -157.6MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-07 10:53:36,304 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:53:36,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.07ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 62.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:53:36,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.44ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 59.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:53:36,304 INFO L158 Benchmark]: Boogie Preprocessor took 64.64ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 56.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:53:36,304 INFO L158 Benchmark]: RCFGBuilder took 493.03ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 66.3MB in the end (delta: -10.2MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-07 10:53:36,304 INFO L158 Benchmark]: TraceAbstraction took 7544.83ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 65.8MB in the beginning and 234.7MB in the end (delta: -168.9MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-07 10:53:36,305 INFO L158 Benchmark]: Witness Printer took 7.98ms. Allocated memory is still 327.2MB. Free memory was 234.7MB in the beginning and 234.7MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:53:36,308 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.07ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 62.6MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.44ms. Allocated memory is still 100.7MB. Free memory was 62.6MB in the beginning and 59.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.64ms. Allocated memory is still 100.7MB. Free memory was 59.6MB in the beginning and 56.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.03ms. Allocated memory is still 100.7MB. Free memory was 56.1MB in the beginning and 66.3MB in the end (delta: -10.2MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7544.83ms. Allocated memory was 100.7MB in the beginning and 327.2MB in the end (delta: 226.5MB). Free memory was 65.8MB in the beginning and 234.7MB in the end (delta: -168.9MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 7.98ms. Allocated memory is still 327.2MB. Free memory was 234.7MB in the beginning and 234.7MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 96. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 32, 0, 15.6, 15.4, 32.2, 1, 256, 5.75, 8.6 }; [L45] unsigned short int* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L47] double* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L48] double* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L49] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L50] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L51] signed short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L52] float* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L53] float* WrapperStruct0_var_1_15_Pointer = &(WrapperStruct0.var_1_15); [L54] unsigned char last_1_WrapperStruct0_var_1_7 = 0; [L55] signed short int last_1_WrapperStruct0_var_1_13 = 256; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=0, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L99] EXPR WrapperStruct0.var_1_7 [L99] last_1_WrapperStruct0_var_1_7 = WrapperStruct0.var_1_7 [L100] EXPR WrapperStruct0.var_1_13 [L100] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L84] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L85] EXPR WrapperStruct0.var_1_8 [L85] EXPR WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L85] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L86] WrapperStruct0.var_1_9 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F [L87] EXPR WrapperStruct0.var_1_9 [L87] EXPR WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] EXPR (WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] CALL assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L87] RET assume_abort_if_not((WrapperStruct0.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_9 <= -1.0e-20F) || (WrapperStruct0.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L88] WrapperStruct0.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct0.var_1_10 [L89] EXPR WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] EXPR (WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] CALL assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L89] RET assume_abort_if_not((WrapperStruct0.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct0.var_1_10 <= -1.0e-20F) || (WrapperStruct0.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L90] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L91] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L93] WrapperStruct0.var_1_14 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct0.var_1_14 [L94] EXPR WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] EXPR (WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct0.var_1_14 >= 0.0F && WrapperStruct0.var_1_14 <= -1.0e-20F) || (WrapperStruct0.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L95] WrapperStruct0.var_1_15 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_15 [L96] EXPR WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] EXPR (WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_15 >= 0.0F && WrapperStruct0.var_1_15 <= -1.0e-20F) || (WrapperStruct0.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct0.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L111] RET updateVariables() [L112] CALL step() [L59] COND TRUE (last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L60] COND FALSE !(last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L68] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_15_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L69] COND FALSE !(((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) [L72] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L72] (*(WrapperStruct0_var_1_13_Pointer)) = (*(WrapperStruct0_var_1_1_Pointer)) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L75] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L75] COND TRUE (((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer)) [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L76] COND FALSE !(last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 [L103] EXPR (last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) [L103] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L103] EXPR (((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR \read(*WrapperStruct0_var_1_10_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) [L103] EXPR \read(*WrapperStruct0_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L103] EXPR ((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR (((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103] EXPR ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L103-L104] return ((((last_1_WrapperStruct0_var_1_13 + ((((last_1_WrapperStruct0_var_1_13) > (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))) < (last_1_WrapperStruct0_var_1_13 * last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 < (last_1_WrapperStruct0_var_1_13 - last_1_WrapperStruct0_var_1_13)) ? ((last_1_WrapperStruct0_var_1_13 != (((((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) < 0 ) ? -((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13))) : ((((last_1_WrapperStruct0_var_1_13) < (last_1_WrapperStruct0_var_1_13)) ? (last_1_WrapperStruct0_var_1_13) : (last_1_WrapperStruct0_var_1_13)))))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13)) : 1) : 1) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_13))) && (((((((*(WrapperStruct0_var_1_8_Pointer))) < ((*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer))) : ((*(WrapperStruct0_var_1_9_Pointer))))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((last_1_WrapperStruct0_var_1_7 && ((*(WrapperStruct0_var_1_1_Pointer)) >= (*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) 0)) : 1) : ((*(WrapperStruct0_var_1_7_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))))) && ((*(WrapperStruct0_var_1_12_Pointer)) ? ((((*(WrapperStruct0_var_1_14_Pointer)) - (*(WrapperStruct0_var_1_15_Pointer))) >= (((*(WrapperStruct0_var_1_8_Pointer)) + (*(WrapperStruct0_var_1_10_Pointer))) + (*(WrapperStruct0_var_1_9_Pointer)))) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (((((*(WrapperStruct0_var_1_1_Pointer))) > ((*(WrapperStruct0_var_1_1_Pointer)))) ? ((*(WrapperStruct0_var_1_1_Pointer))) : ((*(WrapperStruct0_var_1_1_Pointer))))))) : ((*(WrapperStruct0_var_1_13_Pointer)) == ((signed short int) (*(WrapperStruct0_var_1_1_Pointer))))) : 1) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:19}, WrapperStruct0_var_1_12_Pointer={4:27}, WrapperStruct0_var_1_13_Pointer={4:28}, WrapperStruct0_var_1_14_Pointer={4:30}, WrapperStruct0_var_1_15_Pointer={4:34}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:11}, isInitial=1, last_1_WrapperStruct0_var_1_13=256, last_1_WrapperStruct0_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1263 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1259 mSDsluCounter, 6315 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5054 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2233 IncrementalHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 1261 mSDtfsCounter, 2233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=514occurred in iteration=10, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 276 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 856 ConstructedInterpolants, 0 QuantifiedInterpolants, 3965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 840/840 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:53:36,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.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 abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:53:38,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:53:38,506 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:53:38,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:53:38,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:53:38,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:53:38,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:53:38,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:53:38,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:53:38,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:53:38,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:53:38,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:53:38,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:53:38,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:53:38,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:53:38,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:53:38,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:53:38,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:53:38,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:53:38,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:38,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:53:38,535 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:53:38,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:53:38,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:53:38,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:53:38,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:53:38,536 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 -> abb22874cc515e6597c493938d8a3907b8ef4cc1e14b264963b72f5eff3fe5c3 [2024-11-07 10:53:38,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:53:38,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:53:38,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:53:38,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:53:38,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:53:38,858 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-21.i [2024-11-07 10:53:40,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:53:40,483 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:53:40,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-07 10:53:40,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef82ef1d3/205e91b7f2d1499e93784a3b02be35c1/FLAGcee8a7f23 [2024-11-07 10:53:40,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef82ef1d3/205e91b7f2d1499e93784a3b02be35c1 [2024-11-07 10:53:40,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:53:40,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:53:40,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:40,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:53:40,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:53:40,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e532b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40, skipping insertion in model container [2024-11-07 10:53:40,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:53:40,664 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-21.i[917,930] [2024-11-07 10:53:40,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:40,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:53:40,732 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-21.i[917,930] [2024-11-07 10:53:40,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:53:40,776 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:53:40,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40 WrapperNode [2024-11-07 10:53:40,778 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:53:40,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:40,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:53:40,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:53:40,784 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:53:40" (1/1) ... [2024-11-07 10:53:40,797 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:53:40" (1/1) ... [2024-11-07 10:53:40,827 INFO L138 Inliner]: procedures = 36, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 404 [2024-11-07 10:53:40,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:53:40,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:53:40,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:53:40,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:53:40,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,868 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2024-11-07 10:53:40,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:53:40,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:53:40,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:53:40,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:53:40,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (1/1) ... [2024-11-07 10:53:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:53:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:53:40,945 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:53:40,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:53:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:53:40,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:53:40,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-07 10:53:40,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-07 10:53:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:53:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:53:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:53:40,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:53:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:53:40,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:53:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:53:40,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:53:41,068 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:53:41,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:53:51,668 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-07 10:53:51,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:53:51,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:53:51,677 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:53:51,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:51 BoogieIcfgContainer [2024-11-07 10:53:51,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:53:51,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:53:51,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:53:51,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:53:51,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:53:40" (1/3) ... [2024-11-07 10:53:51,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77141466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:51, skipping insertion in model container [2024-11-07 10:53:51,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:53:40" (2/3) ... [2024-11-07 10:53:51,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77141466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:53:51, skipping insertion in model container [2024-11-07 10:53:51,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:53:51" (3/3) ... [2024-11-07 10:53:51,685 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-21.i [2024-11-07 10:53:51,697 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:53:51,698 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:53:51,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:53:51,756 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;@5a9a70fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:53:51,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:53:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:53:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:53:51,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:51,769 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:51,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 306818116, now seen corresponding path program 1 times [2024-11-07 10:53:51,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853436093] [2024-11-07 10:53:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:51,782 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:53:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:51,785 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:53:51,786 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:53:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:53:52,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-07 10:53:52,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:52,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:52,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853436093] [2024-11-07 10:53:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853436093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:52,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:52,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:53:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713591303] [2024-11-07 10:53:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:52,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:53:52,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:52,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:53:52,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:53:52,095 INFO L87 Difference]: Start difference. First operand has 96 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 87 states have internal predecessors, (128), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:53:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:53:52,110 INFO L93 Difference]: Finished difference Result 185 states and 285 transitions. [2024-11-07 10:53:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:53:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2024-11-07 10:53:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:53:52,116 INFO L225 Difference]: With dead ends: 185 [2024-11-07 10:53:52,116 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 10:53:52,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:53:52,120 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:53:52,120 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:53:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 10:53:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 10:53:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 83 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 10:53:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-07 10:53:52,144 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 80 [2024-11-07 10:53:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:53:52,144 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-07 10:53:52,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:53:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-07 10:53:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 10:53:52,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:53:52,147 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 10:53:52,347 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:53:52,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:53:52,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:53:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1397824002, now seen corresponding path program 1 times [2024-11-07 10:53:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:53:52,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128385407] [2024-11-07 10:53:52,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:53:52,349 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:53:52,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:53:52,355 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:53:52,356 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:53:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:53:52,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:53:52,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:53:52,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-07 10:53:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:53:53,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:53:53,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:53:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128385407] [2024-11-07 10:53:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128385407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:53:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:53:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:53:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823756504] [2024-11-07 10:53:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:53:53,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:53:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:53:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:53:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:53:53,220 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:53:55,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:53:59,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:02,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:04,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:08,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:11,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:11,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:11,785 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2024-11-07 10:54:11,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:54:11,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 80 [2024-11-07 10:54:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:11,789 INFO L225 Difference]: With dead ends: 301 [2024-11-07 10:54:11,789 INFO L226 Difference]: Without dead ends: 212 [2024-11-07 10:54:11,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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:54:11,790 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 192 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:11,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 310 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 18.5s Time] [2024-11-07 10:54:11,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-07 10:54:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 185. [2024-11-07 10:54:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 168 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:54:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2024-11-07 10:54:11,814 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 80 [2024-11-07 10:54:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2024-11-07 10:54:11,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:54:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2024-11-07 10:54:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 10:54:11,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:11,817 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:11,851 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:54:12,018 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:54:12,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:12,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:12,022 INFO L85 PathProgramCache]: Analyzing trace with hash 986714953, now seen corresponding path program 1 times [2024-11-07 10:54:12,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:12,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526399909] [2024-11-07 10:54:12,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:12,023 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:54:12,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:12,028 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:54:12,029 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:54:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:12,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:54:12,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:54:12,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:54:12,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:54:12,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526399909] [2024-11-07 10:54:12,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526399909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:12,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:12,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:54:12,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391649683] [2024-11-07 10:54:12,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:12,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:54:12,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:54:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:54:12,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:54:12,325 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:54:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:12,442 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2024-11-07 10:54:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:54:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-11-07 10:54:12,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:12,444 INFO L225 Difference]: With dead ends: 370 [2024-11-07 10:54:12,444 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 10:54:12,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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:54:12,445 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:12,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:54:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 10:54:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 10:54:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4269005847953216) internal successors, (244), 171 states have internal predecessors, (244), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:54:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 272 transitions. [2024-11-07 10:54:12,486 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 272 transitions. Word has length 83 [2024-11-07 10:54:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:12,486 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 272 transitions. [2024-11-07 10:54:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:54:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 272 transitions. [2024-11-07 10:54:12,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 10:54:12,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:12,488 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:12,497 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:54:12,688 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:54:12,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash -863945486, now seen corresponding path program 1 times [2024-11-07 10:54:12,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:12,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731915321] [2024-11-07 10:54:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:12,691 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:54:12,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:12,699 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:54:12,701 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:54:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:13,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:54:13,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:13,202 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 95 treesize of output 41 [2024-11-07 10:54:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-07 10:54:13,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:54:13,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:54:13,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731915321] [2024-11-07 10:54:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731915321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:54:13,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829249631] [2024-11-07 10:54:13,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:13,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:54:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:54:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:54:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:54:13,245 INFO L87 Difference]: Start difference. First operand 188 states and 272 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:54:15,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:18,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:21,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:23,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:23,578 INFO L93 Difference]: Finished difference Result 375 states and 543 transitions. [2024-11-07 10:54:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:54:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2024-11-07 10:54:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:23,580 INFO L225 Difference]: With dead ends: 375 [2024-11-07 10:54:23,580 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 10:54:23,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:54:23,581 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 103 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:23,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 386 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-07 10:54:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 10:54:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-07 10:54:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4152046783625731) internal successors, (242), 171 states have internal predecessors, (242), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:54:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 270 transitions. [2024-11-07 10:54:23,607 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 270 transitions. Word has length 87 [2024-11-07 10:54:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 270 transitions. [2024-11-07 10:54:23,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:54:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 270 transitions. [2024-11-07 10:54:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 10:54:23,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:23,609 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:23,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 10:54:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:54:23,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:23,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:23,813 INFO L85 PathProgramCache]: Analyzing trace with hash 87130808, now seen corresponding path program 1 times [2024-11-07 10:54:23,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431811592] [2024-11-07 10:54:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:23,813 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:54:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:23,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:54:23,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 10:54:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:24,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:54:24,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:24,570 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 95 treesize of output 41 [2024-11-07 10:54:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 10:54:24,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:54:24,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:54:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431811592] [2024-11-07 10:54:24,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431811592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:54:24,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:54:24,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:54:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439355123] [2024-11-07 10:54:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:54:24,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:54:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:54:24,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:54:24,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:54:24,608 INFO L87 Difference]: Start difference. First operand 188 states and 270 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:54:27,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:30,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:32,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:35,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:35,822 INFO L93 Difference]: Finished difference Result 375 states and 539 transitions. [2024-11-07 10:54:35,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:54:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89 [2024-11-07 10:54:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:35,824 INFO L225 Difference]: With dead ends: 375 [2024-11-07 10:54:35,824 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 10:54:35,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:54:35,825 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 93 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:35,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 381 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-11-07 10:54:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 10:54:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2024-11-07 10:54:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.4035087719298245) internal successors, (240), 171 states have internal predecessors, (240), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:54:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 268 transitions. [2024-11-07 10:54:35,834 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 268 transitions. Word has length 89 [2024-11-07 10:54:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:35,834 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 268 transitions. [2024-11-07 10:54:35,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 10:54:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 268 transitions. [2024-11-07 10:54:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 10:54:35,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:35,835 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:35,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 10:54:36,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:54:36,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:36,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:36,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1581519950, now seen corresponding path program 1 times [2024-11-07 10:54:36,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:36,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994923016] [2024-11-07 10:54:36,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:36,037 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:54:36,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:36,039 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:54:36,040 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:54:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:36,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-07 10:54:36,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:36,930 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:54:37,476 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 34 treesize of output 18 [2024-11-07 10:54:37,937 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 34 treesize of output 18 [2024-11-07 10:54:38,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:54:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 10:54:38,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:54:38,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:54:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994923016] [2024-11-07 10:54:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994923016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:54:38,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1772056573] [2024-11-07 10:54:38,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:38,422 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 10:54:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 10:54:38,424 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:54:38,429 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:54:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:40,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 10:54:40,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:40,581 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:54:41,210 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 34 treesize of output 18 [2024-11-07 10:54:41,495 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 34 treesize of output 18 [2024-11-07 10:54:41,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-07 10:54:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 10:54:41,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:54:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1772056573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:54:41,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:54:41,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-07 10:54:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465417096] [2024-11-07 10:54:41,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:54:41,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 10:54:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:54:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 10:54:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:54:41,908 INFO L87 Difference]: Start difference. First operand 188 states and 268 transitions. Second operand has 23 states, 19 states have (on average 6.368421052631579) internal successors, (121), 20 states have internal predecessors, (121), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-07 10:54:44,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:46,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 10:54:48,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:51,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:54,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:57,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:54:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:54:57,600 INFO L93 Difference]: Finished difference Result 363 states and 509 transitions. [2024-11-07 10:54:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 10:54:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 6.368421052631579) internal successors, (121), 20 states have internal predecessors, (121), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) Word has length 91 [2024-11-07 10:54:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:54:57,602 INFO L225 Difference]: With dead ends: 363 [2024-11-07 10:54:57,602 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 10:54:57,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=732, Unknown=0, NotChecked=0, Total=930 [2024-11-07 10:54:57,604 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 167 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:54:57,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 872 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2024-11-07 10:54:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 10:54:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-07 10:54:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 10:54:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 237 transitions. [2024-11-07 10:54:57,623 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 237 transitions. Word has length 91 [2024-11-07 10:54:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:54:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 237 transitions. [2024-11-07 10:54:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 6.368421052631579) internal successors, (121), 20 states have internal predecessors, (121), 10 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-07 10:54:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 237 transitions. [2024-11-07 10:54:57,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 10:54:57,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:54:57,625 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:57,636 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:54:57,843 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:54:58,028 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:54:58,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:54:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:54:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1677279318, now seen corresponding path program 1 times [2024-11-07 10:54:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:54:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341560601] [2024-11-07 10:54:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:54:58,029 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:54:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:54:58,034 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:54:58,039 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:54:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:54:58,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 10:54:58,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:54:59,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-07 10:55:00,678 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 34 treesize of output 18 [2024-11-07 10:55:01,218 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 34 treesize of output 18 [2024-11-07 10:55:01,997 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-07 10:55:01,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-11-07 10:55:02,260 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 45 treesize of output 39 [2024-11-07 10:55:02,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:55:02,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 45 [2024-11-07 10:55:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 39 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 10:55:02,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:55:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 10:55:02,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:55:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341560601] [2024-11-07 10:55:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341560601] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 10:55:02,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 10:55:02,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 19 [2024-11-07 10:55:02,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452075255] [2024-11-07 10:55:02,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:55:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:55:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:55:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:55:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:55:02,872 INFO L87 Difference]: Start difference. First operand 175 states and 237 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-07 10:55:05,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:55:06,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []