./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.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-55.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', 'f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da'] 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-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:57:26,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:57:26,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:57:26,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:57:26,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:57:26,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:57:26,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:57:26,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:57:26,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:57:26,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:57:26,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:57:26,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:57:26,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:57:26,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:57:26,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:57:26,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:57:26,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:57:26,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:57:26,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:57:26,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:57:26,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:57:26,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:57:26,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:57:26,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:57:26,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:57:26,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:57:26,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:26,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:57:26,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:57:26,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:57:26,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:57:26,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:57:26,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:57:26,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:57:26,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:57:26,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:57:26,791 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-11-07 10:57:27,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:57:27,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:57:27,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:57:27,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:57:27,072 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:57:27,074 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-55.i [2024-11-07 10:57:28,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:57:28,636 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:57:28,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-07 10:57:28,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/feb1bbbfe/6c5cc9e27304443b87d89220160f4ce7/FLAGd2d566f0d [2024-11-07 10:57:28,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/feb1bbbfe/6c5cc9e27304443b87d89220160f4ce7 [2024-11-07 10:57:28,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:57:28,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:57:28,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:28,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:57:28,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:57:28,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:28" (1/1) ... [2024-11-07 10:57:28,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c0b24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:28, skipping insertion in model container [2024-11-07 10:57:28,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:28" (1/1) ... [2024-11-07 10:57:29,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:57:29,133 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-55.i[917,930] [2024-11-07 10:57:29,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:29,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:57:29,209 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-55.i[917,930] [2024-11-07 10:57:29,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:29,254 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:57:29,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29 WrapperNode [2024-11-07 10:57:29,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:29,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:29,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:57:29,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:57:29,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,335 INFO L138 Inliner]: procedures = 30, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-07 10:57:29,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:29,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:57:29,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:57:29,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:57:29,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,367 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 10:57:29,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:57:29,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:57:29,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:57:29,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:57:29,423 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (1/1) ... [2024-11-07 10:57:29,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:57:29,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:57:29,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:57:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:57:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:57:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 10:57:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:57:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:57:29,617 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:57:29,619 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:57:30,227 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-07 10:57:30,227 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:57:30,239 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:57:30,241 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:57:30,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:30 BoogieIcfgContainer [2024-11-07 10:57:30,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:57:30,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:57:30,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:57:30,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:57:30,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:57:28" (1/3) ... [2024-11-07 10:57:30,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d45766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:30, skipping insertion in model container [2024-11-07 10:57:30,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:29" (2/3) ... [2024-11-07 10:57:30,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d45766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:30, skipping insertion in model container [2024-11-07 10:57:30,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:30" (3/3) ... [2024-11-07 10:57:30,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-07 10:57:30,267 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:57:30,267 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:57:30,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:57:30,332 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;@67c36bd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:57:30,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:57:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:57:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:57:30,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:30,353 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:30,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:30,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:30,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1876789283, now seen corresponding path program 1 times [2024-11-07 10:57:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187578800] [2024-11-07 10:57:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:30,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:31,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:31,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187578800] [2024-11-07 10:57:31,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187578800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:31,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:31,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:57:31,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211780669] [2024-11-07 10:57:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:31,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:57:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:31,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:57:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:31,145 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:31,226 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2024-11-07 10:57:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-07 10:57:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:31,235 INFO L225 Difference]: With dead ends: 218 [2024-11-07 10:57:31,235 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:57:31,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:31,241 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:31,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:57:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-07 10:57:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:57:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-07 10:57:31,284 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-07 10:57:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:31,286 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-07 10:57:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-07 10:57:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:57:31,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:31,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:31,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:57:31,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:31,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1738119643, now seen corresponding path program 1 times [2024-11-07 10:57:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247446318] [2024-11-07 10:57:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:31,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247446318] [2024-11-07 10:57:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247446318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:31,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:57:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771990166] [2024-11-07 10:57:31,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:31,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:57:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:31,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:57:31,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:31,713 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:31,772 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-07 10:57:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-07 10:57:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:31,775 INFO L225 Difference]: With dead ends: 218 [2024-11-07 10:57:31,778 INFO L226 Difference]: Without dead ends: 112 [2024-11-07 10:57:31,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:31,779 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:31,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-07 10:57:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-07 10:57:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:57:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-07 10:57:31,799 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-07 10:57:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:31,800 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-07 10:57:31,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-07 10:57:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:57:31,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:31,803 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:31,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:57:31,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:31,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 36887719, now seen corresponding path program 1 times [2024-11-07 10:57:31,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:31,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537990541] [2024-11-07 10:57:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:31,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:32,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:32,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537990541] [2024-11-07 10:57:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537990541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:57:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604899464] [2024-11-07 10:57:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:32,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:57:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:32,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:57:32,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:32,076 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:32,105 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-07 10:57:32,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:32,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-07 10:57:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:32,107 INFO L225 Difference]: With dead ends: 222 [2024-11-07 10:57:32,107 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 10:57:32,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:57:32,108 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:32,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 10:57:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-07 10:57:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:57:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-07 10:57:32,120 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-07 10:57:32,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:32,120 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-07 10:57:32,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-07 10:57:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:57:32,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:32,125 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:32,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:57:32,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 38734761, now seen corresponding path program 1 times [2024-11-07 10:57:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012612483] [2024-11-07 10:57:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:32,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012612483] [2024-11-07 10:57:32,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012612483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:32,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:32,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:57:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341461638] [2024-11-07 10:57:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:32,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:57:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:57:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:32,326 INFO L87 Difference]: Start difference. First operand 113 states and 161 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:32,346 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2024-11-07 10:57:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:57:32,346 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-07 10:57:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:32,349 INFO L225 Difference]: With dead ends: 223 [2024-11-07 10:57:32,349 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 10:57:32,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:32,350 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:32,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 10:57:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-07 10:57:32,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:57:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2024-11-07 10:57:32,364 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 115 [2024-11-07 10:57:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:32,364 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2024-11-07 10:57:32,364 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2024-11-07 10:57:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:57:32,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:32,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:32,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:57:32,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash -257716476, now seen corresponding path program 1 times [2024-11-07 10:57:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:32,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307627256] [2024-11-07 10:57:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307627256] [2024-11-07 10:57:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307627256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:34,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:34,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:57:34,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737742581] [2024-11-07 10:57:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:34,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:57:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:34,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:57:34,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:57:34,292 INFO L87 Difference]: Start difference. First operand 113 states and 160 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:57:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:35,064 INFO L93 Difference]: Finished difference Result 394 states and 556 transitions. [2024-11-07 10:57:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:35,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-07 10:57:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:35,066 INFO L225 Difference]: With dead ends: 394 [2024-11-07 10:57:35,066 INFO L226 Difference]: Without dead ends: 284 [2024-11-07 10:57:35,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:57:35,068 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 427 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:35,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 555 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 10:57:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-07 10:57:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 172. [2024-11-07 10:57:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 145 states have internal predecessors, (199), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:57:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2024-11-07 10:57:35,106 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 117 [2024-11-07 10:57:35,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:35,107 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2024-11-07 10:57:35,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:57:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2024-11-07 10:57:35,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 10:57:35,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:35,109 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:35,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:57:35,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:35,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 37312769, now seen corresponding path program 1 times [2024-11-07 10:57:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:35,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463966586] [2024-11-07 10:57:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:35,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463966586] [2024-11-07 10:57:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463966586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:35,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592715782] [2024-11-07 10:57:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:35,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:35,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:35,375 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:35,708 INFO L93 Difference]: Finished difference Result 340 states and 482 transitions. [2024-11-07 10:57:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:35,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-07 10:57:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:35,711 INFO L225 Difference]: With dead ends: 340 [2024-11-07 10:57:35,711 INFO L226 Difference]: Without dead ends: 230 [2024-11-07 10:57:35,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:35,713 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 62 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:35,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 575 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:57:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-07 10:57:35,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 175. [2024-11-07 10:57:35,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.364864864864865) internal successors, (202), 148 states have internal predecessors, (202), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:57:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 250 transitions. [2024-11-07 10:57:35,741 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 250 transitions. Word has length 118 [2024-11-07 10:57:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:35,741 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 250 transitions. [2024-11-07 10:57:35,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 250 transitions. [2024-11-07 10:57:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:57:35,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:35,743 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:35,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:57:35,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:35,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:35,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1227907559, now seen corresponding path program 1 times [2024-11-07 10:57:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:35,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921005531] [2024-11-07 10:57:35,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:36,971 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:36,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921005531] [2024-11-07 10:57:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921005531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:36,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:36,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:57:36,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076292934] [2024-11-07 10:57:36,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:36,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:57:36,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:36,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:57:36,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:57:36,973 INFO L87 Difference]: Start difference. First operand 175 states and 250 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:57:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:37,507 INFO L93 Difference]: Finished difference Result 296 states and 420 transitions. [2024-11-07 10:57:37,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:37,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-11-07 10:57:37,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:37,510 INFO L225 Difference]: With dead ends: 296 [2024-11-07 10:57:37,510 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 10:57:37,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:57:37,511 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 230 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:37,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 402 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:57:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 10:57:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-07 10:57:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 152 states have (on average 1.355263157894737) internal successors, (206), 152 states have internal predecessors, (206), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:57:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2024-11-07 10:57:37,529 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 119 [2024-11-07 10:57:37,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:37,529 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2024-11-07 10:57:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:57:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2024-11-07 10:57:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:57:37,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:37,531 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:37,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:57:37,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:37,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1143831703, now seen corresponding path program 1 times [2024-11-07 10:57:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:37,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339671277] [2024-11-07 10:57:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:37,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:38,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:38,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339671277] [2024-11-07 10:57:38,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339671277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:38,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:38,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 10:57:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898838604] [2024-11-07 10:57:38,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:38,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 10:57:38,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:38,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 10:57:38,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:57:38,481 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:38,949 INFO L93 Difference]: Finished difference Result 355 states and 497 transitions. [2024-11-07 10:57:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:57:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-07 10:57:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:38,951 INFO L225 Difference]: With dead ends: 355 [2024-11-07 10:57:38,951 INFO L226 Difference]: Without dead ends: 240 [2024-11-07 10:57:38,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:57:38,953 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 262 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:38,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 612 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:57:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-07 10:57:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 199. [2024-11-07 10:57:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.3430232558139534) internal successors, (231), 172 states have internal predecessors, (231), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 10:57:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2024-11-07 10:57:38,988 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 119 [2024-11-07 10:57:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:38,988 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2024-11-07 10:57:38,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2024-11-07 10:57:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:57:38,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:38,989 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:38,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:57:38,990 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:38,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1351634020, now seen corresponding path program 1 times [2024-11-07 10:57:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476366446] [2024-11-07 10:57:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:40,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476366446] [2024-11-07 10:57:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476366446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:40,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:57:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154261520] [2024-11-07 10:57:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:40,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:57:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:57:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:57:40,750 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:57:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:41,145 INFO L93 Difference]: Finished difference Result 442 states and 620 transitions. [2024-11-07 10:57:41,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:57:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-11-07 10:57:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:41,147 INFO L225 Difference]: With dead ends: 442 [2024-11-07 10:57:41,150 INFO L226 Difference]: Without dead ends: 309 [2024-11-07 10:57:41,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 10:57:41,151 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 289 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:41,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 384 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:57:41,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-07 10:57:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2024-11-07 10:57:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 266 states have (on average 1.349624060150376) internal successors, (359), 266 states have internal predecessors, (359), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 431 transitions. [2024-11-07 10:57:41,184 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 431 transitions. Word has length 119 [2024-11-07 10:57:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:41,184 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 431 transitions. [2024-11-07 10:57:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:57:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 431 transitions. [2024-11-07 10:57:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:57:41,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:41,186 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:41,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:57:41,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1102352610, now seen corresponding path program 1 times [2024-11-07 10:57:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396512331] [2024-11-07 10:57:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396512331] [2024-11-07 10:57:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396512331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:41,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:41,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734833333] [2024-11-07 10:57:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:41,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:41,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:41,362 INFO L87 Difference]: Start difference. First operand 306 states and 431 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:41,406 INFO L93 Difference]: Finished difference Result 552 states and 776 transitions. [2024-11-07 10:57:41,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:41,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-07 10:57:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:41,409 INFO L225 Difference]: With dead ends: 552 [2024-11-07 10:57:41,409 INFO L226 Difference]: Without dead ends: 312 [2024-11-07 10:57:41,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:41,410 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:41,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-07 10:57:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-07 10:57:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 272 states have (on average 1.3419117647058822) internal successors, (365), 272 states have internal predecessors, (365), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 437 transitions. [2024-11-07 10:57:41,439 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 437 transitions. Word has length 121 [2024-11-07 10:57:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:41,440 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 437 transitions. [2024-11-07 10:57:41,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 437 transitions. [2024-11-07 10:57:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:57:41,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:41,441 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:41,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:57:41,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:41,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2113469860, now seen corresponding path program 1 times [2024-11-07 10:57:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:41,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205688835] [2024-11-07 10:57:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205688835] [2024-11-07 10:57:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205688835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408195326] [2024-11-07 10:57:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:41,694 INFO L87 Difference]: Start difference. First operand 312 states and 437 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:41,902 INFO L93 Difference]: Finished difference Result 634 states and 879 transitions. [2024-11-07 10:57:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:41,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-07 10:57:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:41,905 INFO L225 Difference]: With dead ends: 634 [2024-11-07 10:57:41,905 INFO L226 Difference]: Without dead ends: 388 [2024-11-07 10:57:41,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:41,909 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 41 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:41,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 489 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:57:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-07 10:57:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 318. [2024-11-07 10:57:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 278 states have (on average 1.341726618705036) internal successors, (373), 278 states have internal predecessors, (373), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2024-11-07 10:57:41,953 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 121 [2024-11-07 10:57:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2024-11-07 10:57:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2024-11-07 10:57:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-07 10:57:41,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:41,958 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:41,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:57:41,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2054832001, now seen corresponding path program 1 times [2024-11-07 10:57:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825687683] [2024-11-07 10:57:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825687683] [2024-11-07 10:57:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825687683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:57:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323538727] [2024-11-07 10:57:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:57:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:43,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:57:43,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:57:43,910 INFO L87 Difference]: Start difference. First operand 318 states and 445 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:57:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:44,786 INFO L93 Difference]: Finished difference Result 634 states and 880 transitions. [2024-11-07 10:57:44,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:44,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2024-11-07 10:57:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:44,789 INFO L225 Difference]: With dead ends: 634 [2024-11-07 10:57:44,789 INFO L226 Difference]: Without dead ends: 382 [2024-11-07 10:57:44,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:57:44,791 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 250 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:44,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 658 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 10:57:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-07 10:57:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 337. [2024-11-07 10:57:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.3333333333333333) internal successors, (396), 297 states have internal predecessors, (396), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 468 transitions. [2024-11-07 10:57:44,826 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 468 transitions. Word has length 121 [2024-11-07 10:57:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:44,826 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 468 transitions. [2024-11-07 10:57:44,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:57:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 468 transitions. [2024-11-07 10:57:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:57:44,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:44,828 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:44,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 10:57:44,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:44,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -784431070, now seen corresponding path program 1 times [2024-11-07 10:57:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23778714] [2024-11-07 10:57:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:44,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:44,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23778714] [2024-11-07 10:57:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23778714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:44,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919519828] [2024-11-07 10:57:44,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:44,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:44,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:44,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:44,983 INFO L87 Difference]: Start difference. First operand 337 states and 468 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:45,029 INFO L93 Difference]: Finished difference Result 610 states and 845 transitions. [2024-11-07 10:57:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:57:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-07 10:57:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:45,032 INFO L225 Difference]: With dead ends: 610 [2024-11-07 10:57:45,032 INFO L226 Difference]: Without dead ends: 343 [2024-11-07 10:57:45,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:45,033 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:45,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-07 10:57:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2024-11-07 10:57:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 303 states have (on average 1.3267326732673268) internal successors, (402), 303 states have internal predecessors, (402), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 474 transitions. [2024-11-07 10:57:45,067 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 474 transitions. Word has length 122 [2024-11-07 10:57:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:45,069 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 474 transitions. [2024-11-07 10:57:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 474 transitions. [2024-11-07 10:57:45,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:57:45,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:45,071 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:45,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 10:57:45,072 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:45,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash -43600819, now seen corresponding path program 1 times [2024-11-07 10:57:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:45,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548101695] [2024-11-07 10:57:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548101695] [2024-11-07 10:57:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548101695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:57:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192301596] [2024-11-07 10:57:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:45,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:57:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:57:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:45,164 INFO L87 Difference]: Start difference. First operand 343 states and 474 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:45,211 INFO L93 Difference]: Finished difference Result 515 states and 710 transitions. [2024-11-07 10:57:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:57:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-07 10:57:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:45,215 INFO L225 Difference]: With dead ends: 515 [2024-11-07 10:57:45,215 INFO L226 Difference]: Without dead ends: 346 [2024-11-07 10:57:45,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:45,216 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 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:57:45,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-07 10:57:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2024-11-07 10:57:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 305 states have (on average 1.3245901639344262) internal successors, (404), 305 states have internal predecessors, (404), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 476 transitions. [2024-11-07 10:57:45,248 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 476 transitions. Word has length 122 [2024-11-07 10:57:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:45,248 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 476 transitions. [2024-11-07 10:57:45,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 476 transitions. [2024-11-07 10:57:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 10:57:45,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:45,250 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:45,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 10:57:45,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:45,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -745200693, now seen corresponding path program 1 times [2024-11-07 10:57:45,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:45,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944229734] [2024-11-07 10:57:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:45,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944229734] [2024-11-07 10:57:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944229734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:57:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382827384] [2024-11-07 10:57:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:57:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:57:45,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:57:45,640 INFO L87 Difference]: Start difference. First operand 345 states and 476 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:46,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:46,021 INFO L93 Difference]: Finished difference Result 745 states and 1013 transitions. [2024-11-07 10:57:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 10:57:46,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-07 10:57:46,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:46,024 INFO L225 Difference]: With dead ends: 745 [2024-11-07 10:57:46,024 INFO L226 Difference]: Without dead ends: 460 [2024-11-07 10:57:46,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:57:46,026 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 176 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:46,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 569 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:57:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-07 10:57:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 370. [2024-11-07 10:57:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 330 states have (on average 1.3151515151515152) internal successors, (434), 330 states have internal predecessors, (434), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 506 transitions. [2024-11-07 10:57:46,077 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 506 transitions. Word has length 122 [2024-11-07 10:57:46,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:46,078 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 506 transitions. [2024-11-07 10:57:46,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 506 transitions. [2024-11-07 10:57:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:57:46,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:46,080 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:46,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 10:57:46,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:46,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash -394872803, now seen corresponding path program 1 times [2024-11-07 10:57:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628917696] [2024-11-07 10:57:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:46,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628917696] [2024-11-07 10:57:46,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628917696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:46,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:46,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:57:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116021852] [2024-11-07 10:57:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:46,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:57:46,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:57:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:57:46,349 INFO L87 Difference]: Start difference. First operand 370 states and 506 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:46,578 INFO L93 Difference]: Finished difference Result 731 states and 994 transitions. [2024-11-07 10:57:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:57:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-07 10:57:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:46,582 INFO L225 Difference]: With dead ends: 731 [2024-11-07 10:57:46,582 INFO L226 Difference]: Without dead ends: 452 [2024-11-07 10:57:46,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:57:46,584 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 124 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:46,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 481 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:57:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-07 10:57:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 368. [2024-11-07 10:57:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 328 states have internal predecessors, (428), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 500 transitions. [2024-11-07 10:57:46,618 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 500 transitions. Word has length 124 [2024-11-07 10:57:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:46,618 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 500 transitions. [2024-11-07 10:57:46,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 500 transitions. [2024-11-07 10:57:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 10:57:46,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:46,620 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:46,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 10:57:46,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:46,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816545, now seen corresponding path program 1 times [2024-11-07 10:57:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:46,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895370112] [2024-11-07 10:57:46,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:46,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:48,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895370112] [2024-11-07 10:57:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895370112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:48,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:57:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355392885] [2024-11-07 10:57:48,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:57:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:48,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:57:48,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:57:48,349 INFO L87 Difference]: Start difference. First operand 368 states and 500 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 10:57:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:49,033 INFO L93 Difference]: Finished difference Result 564 states and 762 transitions. [2024-11-07 10:57:49,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:57:49,033 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-07 10:57:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:49,036 INFO L225 Difference]: With dead ends: 564 [2024-11-07 10:57:49,036 INFO L226 Difference]: Without dead ends: 401 [2024-11-07 10:57:49,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:57:49,037 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 442 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:49,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 483 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:57:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-07 10:57:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 357. [2024-11-07 10:57:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.3028391167192428) internal successors, (413), 317 states have internal predecessors, (413), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 485 transitions. [2024-11-07 10:57:49,075 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 485 transitions. Word has length 124 [2024-11-07 10:57:49,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 485 transitions. [2024-11-07 10:57:49,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-07 10:57:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 485 transitions. [2024-11-07 10:57:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:57:49,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:49,079 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:49,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 10:57:49,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 786667071, now seen corresponding path program 1 times [2024-11-07 10:57:49,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:49,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656634961] [2024-11-07 10:57:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:57:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 10:57:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 10:57:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 10:57:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:57:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 10:57:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 10:57:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 10:57:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:57:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:57:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 10:57:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 10:57:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:57:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:57:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:57:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656634961] [2024-11-07 10:57:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656634961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:57:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:57:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 10:57:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458589184] [2024-11-07 10:57:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:57:49,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 10:57:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:57:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 10:57:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:49,194 INFO L87 Difference]: Start difference. First operand 357 states and 485 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:57:49,227 INFO L93 Difference]: Finished difference Result 634 states and 863 transitions. [2024-11-07 10:57:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:57:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-07 10:57:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:57:49,229 INFO L225 Difference]: With dead ends: 634 [2024-11-07 10:57:49,229 INFO L226 Difference]: Without dead ends: 357 [2024-11-07 10:57:49,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 10:57:49,231 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 10:57:49,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:57:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-07 10:57:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-07 10:57:49,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.2965299684542586) internal successors, (411), 317 states have internal predecessors, (411), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:57:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 483 transitions. [2024-11-07 10:57:49,264 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 483 transitions. Word has length 126 [2024-11-07 10:57:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:57:49,264 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 483 transitions. [2024-11-07 10:57:49,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:57:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 483 transitions. [2024-11-07 10:57:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 10:57:49,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:57:49,266 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 10:57:49,266 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:57:49,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:57:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash 253819977, now seen corresponding path program 1 times [2024-11-07 10:57:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:57:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846342884] [2024-11-07 10:57:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:57:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:57:49,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:57:49,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 10:57:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 10:57:49,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 10:57:49,581 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 10:57:49,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 10:57:49,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 10:57:49,587 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:57:49,756 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 10:57:49,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:57:49 BoogieIcfgContainer [2024-11-07 10:57:49,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 10:57:49,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 10:57:49,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 10:57:49,760 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 10:57:49,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:30" (3/4) ... [2024-11-07 10:57:49,764 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 10:57:49,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 10:57:49,766 INFO L158 Benchmark]: Toolchain (without parser) took 20772.02ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 91.7MB in the beginning and 256.3MB in the end (delta: -164.6MB). Peak memory consumption was 237.7MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,766 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.37ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.44ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,767 INFO L158 Benchmark]: Boogie Preprocessor took 81.97ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 69.6MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,767 INFO L158 Benchmark]: RCFGBuilder took 823.03ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 80.1MB in the end (delta: -10.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,767 INFO L158 Benchmark]: TraceAbstraction took 19516.06ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 79.2MB in the beginning and 256.5MB in the end (delta: -177.2MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. [2024-11-07 10:57:49,768 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 520.1MB. Free memory was 256.5MB in the beginning and 256.3MB in the end (delta: 135.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 10:57:49,769 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.30ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.37ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.44ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.97ms. Allocated memory is still 117.4MB. Free memory was 72.6MB in the beginning and 69.6MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 823.03ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 80.1MB in the end (delta: -10.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19516.06ms. Allocated memory was 117.4MB in the beginning and 520.1MB in the end (delta: 402.7MB). Free memory was 79.2MB in the beginning and 256.5MB in the end (delta: -177.2MB). Peak memory consumption was 223.5MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 520.1MB. Free memory was 256.5MB in the beginning and 256.3MB in the end (delta: 135.1kB). 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 130, overapproximation of shiftRight at line 93, overapproximation of someBinaryArithmeticDOUBLEoperation at line 88. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L59] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L60] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] unsigned long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] signed long int last_1_WrapperStruct00_var_1_12 = -5; [L70] unsigned char last_1_WrapperStruct00_var_1_17 = 2; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=0, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L126] EXPR WrapperStruct00.var_1_12 [L126] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_17 [L127] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L110] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L114] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L138] RET updateVariables() [L139] CALL step() [L74] unsigned char stepLocal_1 = last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17; [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17; [L76] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L76] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L77] stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L77] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L87] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L88] (*(WrapperStruct00_var_1_7_Pointer)) = ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))) [L90] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L90] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L91] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L91] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L92] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] signed long int stepLocal_3 = ((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L94] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L94] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)) / -8; [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-5] [L95] COND FALSE !((~ (*(WrapperStruct00_var_1_17_Pointer))) <= stepLocal_3) [L100] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L100] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L100] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) [L130] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130-L131] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2306 mSDsluCounter, 8626 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6042 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2940 IncrementalHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 2584 mSDtfsCounter, 2940 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=15, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 550 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2281 NumberOfCodeBlocks, 2281 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 12726 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 4752/4752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 10:57:49,803 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-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:57:51,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:57:52,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 10:57:52,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:57:52,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:57:52,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:57:52,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:57:52,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:57:52,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:57:52,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:57:52,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:57:52,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:57:52,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:57:52,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:57:52,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:57:52,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 10:57:52,139 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:57:52,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:57:52,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:57:52,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:57:52,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:57:52,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:57:52,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:52,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:57:52,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:57:52,143 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-11-07 10:57:52,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:57:52,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:57:52,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:57:52,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:57:52,453 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:57:52,454 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-55.i [2024-11-07 10:57:53,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:57:53,959 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:57:53,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-07 10:57:53,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a414eceb3/f7976b6e540f4e59951e5ff7e1777006/FLAGcc44784d0 [2024-11-07 10:57:53,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a414eceb3/f7976b6e540f4e59951e5ff7e1777006 [2024-11-07 10:57:53,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:57:53,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:57:53,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:53,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:57:53,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:57:53,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:53,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:53, skipping insertion in model container [2024-11-07 10:57:53,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:57:53" (1/1) ... [2024-11-07 10:57:54,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:57:54,160 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-55.i[917,930] [2024-11-07 10:57:54,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:54,251 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:57:54,261 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-55.i[917,930] [2024-11-07 10:57:54,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:57:54,333 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:57:54,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54 WrapperNode [2024-11-07 10:57:54,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:57:54,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:54,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:57:54,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:57:54,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,400 INFO L138 Inliner]: procedures = 40, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2024-11-07 10:57:54,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:57:54,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:57:54,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:57:54,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:57:54,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,444 INFO L175 MemorySlicer]: Split 109 memory accesses to 2 slices as follows [2, 107]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-07 10:57:54,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,467 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:57:54,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:57:54,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:57:54,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:57:54,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (1/1) ... [2024-11-07 10:57:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:57:54,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:57:54,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 10:57:54,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-07 10:57:54,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-07 10:57:54,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-07 10:57:54,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-07 10:57:54,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-07 10:57:54,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:57:54,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:57:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-07 10:57:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-07 10:57:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:57:54,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:57:54,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-07 10:57:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-07 10:57:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-07 10:57:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-07 10:57:54,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 10:57:54,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 10:57:54,719 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:57:54,721 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:57:59,973 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-07 10:57:59,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:57:59,985 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:57:59,985 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:57:59,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:59 BoogieIcfgContainer [2024-11-07 10:57:59,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:57:59,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:57:59,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:57:59,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:57:59,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:57:53" (1/3) ... [2024-11-07 10:57:59,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cb442b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:59, skipping insertion in model container [2024-11-07 10:57:59,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:57:54" (2/3) ... [2024-11-07 10:57:59,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cb442b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:57:59, skipping insertion in model container [2024-11-07 10:57:59,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:57:59" (3/3) ... [2024-11-07 10:57:59,995 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-07 10:58:00,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:58:00,008 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:58:00,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:58:00,084 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;@569ff25b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:58:00,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:58:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:58:00,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:00,097 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:00,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:00,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2007882332, now seen corresponding path program 1 times [2024-11-07 10:58:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:00,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38725244] [2024-11-07 10:58:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:00,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:00,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:00,118 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:58:00,119 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:58:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:00,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 10:58:00,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-07 10:58:00,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:00,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:00,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38725244] [2024-11-07 10:58:00,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38725244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:00,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 10:58:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048569751] [2024-11-07 10:58:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:00,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 10:58:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 10:58:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 10:58:00,790 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:00,810 INFO L93 Difference]: Finished difference Result 191 states and 298 transitions. [2024-11-07 10:58:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 10:58:00,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-07 10:58:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:00,817 INFO L225 Difference]: With dead ends: 191 [2024-11-07 10:58:00,817 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 10:58:00,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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:58:00,822 INFO L432 NwaCegarLoop]: 137 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, 137 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:58:00,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 10:58:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 10:58:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 10:58:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-07 10:58:00,860 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 113 [2024-11-07 10:58:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:00,861 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-07 10:58:00,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-07 10:58:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:58:00,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:00,866 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:00,885 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:58:01,066 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:58:01,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:01,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 104285460, now seen corresponding path program 1 times [2024-11-07 10:58:01,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:01,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902854535] [2024-11-07 10:58:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:01,071 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:58:01,072 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:58:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:01,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 10:58:01,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:58:01,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:01,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:01,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902854535] [2024-11-07 10:58:01,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902854535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:01,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:01,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:58:01,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391309605] [2024-11-07 10:58:01,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:01,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:58:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:58:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:58:01,743 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:01,852 INFO L93 Difference]: Finished difference Result 189 states and 274 transitions. [2024-11-07 10:58:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:58:01,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-07 10:58:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:01,854 INFO L225 Difference]: With dead ends: 189 [2024-11-07 10:58:01,854 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 10:58:01,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:58:01,856 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:01,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:58:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 10:58:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-07 10:58:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-07 10:58:01,866 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 113 [2024-11-07 10:58:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:01,867 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-07 10:58:01,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-07 10:58:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:58:01,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:01,869 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:01,887 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:02,069 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:58:02,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:02,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash 836252886, now seen corresponding path program 1 times [2024-11-07 10:58:02,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:02,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869350867] [2024-11-07 10:58:02,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:02,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:02,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:02,076 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:58:02,077 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:58:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:02,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 10:58:02,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:02,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:02,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869350867] [2024-11-07 10:58:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869350867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:58:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997241686] [2024-11-07 10:58:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 10:58:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 10:58:02,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 10:58:02,664 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:02,921 INFO L93 Difference]: Finished difference Result 196 states and 282 transitions. [2024-11-07 10:58:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 10:58:02,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-07 10:58:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:02,923 INFO L225 Difference]: With dead ends: 196 [2024-11-07 10:58:02,923 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 10:58:02,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:58:02,924 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:02,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 512 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:58:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 10:58:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-07 10:58:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-07 10:58:02,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 113 [2024-11-07 10:58:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:02,932 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-07 10:58:02,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-07 10:58:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:58:02,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:02,934 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:02,949 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:58:03,134 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:58:03,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:03,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1516311256, now seen corresponding path program 1 times [2024-11-07 10:58:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160419366] [2024-11-07 10:58:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:03,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:03,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:03,138 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:58:03,141 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:58:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:03,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:58:03,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:03,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:03,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160419366] [2024-11-07 10:58:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160419366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:03,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:58:03,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644639129] [2024-11-07 10:58:03,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:58:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:03,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:58:03,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:58:03,742 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:03,925 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-07 10:58:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 10:58:03,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-07 10:58:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:03,929 INFO L225 Difference]: With dead ends: 202 [2024-11-07 10:58:03,929 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 10:58:03,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:58:03,930 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:03,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 630 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:58:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 10:58:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-07 10:58:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-07 10:58:03,941 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 113 [2024-11-07 10:58:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:03,941 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-07 10:58:03,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-07 10:58:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:58:03,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:03,947 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:03,971 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:58:04,148 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:58:04,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1003648678, now seen corresponding path program 1 times [2024-11-07 10:58:04,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:04,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457950685] [2024-11-07 10:58:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:04,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:04,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:04,152 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:58:04,153 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:58:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:04,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 10:58:04,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 10:58:04,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:04,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:04,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457950685] [2024-11-07 10:58:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457950685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:04,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 10:58:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520315904] [2024-11-07 10:58:04,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:04,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 10:58:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 10:58:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:58:04,704 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:04,968 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-07 10:58:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:58:04,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-07 10:58:04,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:04,971 INFO L225 Difference]: With dead ends: 206 [2024-11-07 10:58:04,971 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:58:04,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:58:04,973 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:04,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:58:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:58:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-07 10:58:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-07 10:58:04,980 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 113 [2024-11-07 10:58:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:04,981 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-07 10:58:04,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-07 10:58:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-07 10:58:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:58:04,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:04,983 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:05,000 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:58:05,183 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:58:05,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1001801636, now seen corresponding path program 1 times [2024-11-07 10:58:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005484203] [2024-11-07 10:58:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:05,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:05,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:05,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:58:05,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 10:58:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:05,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:58:05,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:05,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:05,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-07 10:58:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-07 10:58:05,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:05,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:05,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005484203] [2024-11-07 10:58:05,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005484203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:05,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:05,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:58:05,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325940998] [2024-11-07 10:58:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:05,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:58:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:05,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:58:05,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:58:05,899 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:10,283 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:58:13,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:17,360 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:58:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:17,650 INFO L93 Difference]: Finished difference Result 208 states and 292 transitions. [2024-11-07 10:58:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:58:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-07 10:58:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:17,652 INFO L225 Difference]: With dead ends: 208 [2024-11-07 10:58:17,652 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:58:17,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:58:17,653 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 117 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 393 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.6s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:17,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 393 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2024-11-07 10:58:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:58:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-07 10:58:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2024-11-07 10:58:17,660 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 113 [2024-11-07 10:58:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:17,661 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2024-11-07 10:58:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2024-11-07 10:58:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:58:17,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:17,664 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:17,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 10:58:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:17,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -766924584, now seen corresponding path program 1 times [2024-11-07 10:58:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460478079] [2024-11-07 10:58:17,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:17,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:17,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:17,867 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:58:17,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-07 10:58:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:18,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 10:58:18,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 10:58:18,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:18,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:18,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460478079] [2024-11-07 10:58:18,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460478079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:18,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:18,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 10:58:18,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144872256] [2024-11-07 10:58:18,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:18,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:58:18,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:18,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:58:18,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:58:18,497 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:58:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:18,751 INFO L93 Difference]: Finished difference Result 211 states and 294 transitions. [2024-11-07 10:58:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:58:18,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2024-11-07 10:58:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:18,753 INFO L225 Difference]: With dead ends: 211 [2024-11-07 10:58:18,753 INFO L226 Difference]: Without dead ends: 107 [2024-11-07 10:58:18,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 10:58:18,755 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:18,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 569 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:58:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-07 10:58:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-07 10:58:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-11-07 10:58:18,769 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 115 [2024-11-07 10:58:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-11-07 10:58:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-07 10:58:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-07 10:58:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:58:18,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:18,771 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:18,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-07 10:58:18,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:18,972 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:18,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2091780778, now seen corresponding path program 1 times [2024-11-07 10:58:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443441560] [2024-11-07 10:58:18,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:18,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:18,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:18,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:58:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-07 10:58:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:19,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:58:19,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:19,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:19,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-07 10:58:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-07 10:58:19,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:19,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:19,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443441560] [2024-11-07 10:58:19,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443441560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:19,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:19,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:58:19,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831404150] [2024-11-07 10:58:19,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:58:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:58:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:58:19,773 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:20,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:23,742 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:58:28,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:31,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:31,996 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2024-11-07 10:58:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:58:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-07 10:58:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:31,998 INFO L225 Difference]: With dead ends: 208 [2024-11-07 10:58:31,998 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 10:58:31,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 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:58:31,999 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:32,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 385 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2024-11-07 10:58:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 10:58:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-07 10:58:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-07 10:58:32,006 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 115 [2024-11-07 10:58:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:32,006 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-07 10:58:32,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-07 10:58:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:58:32,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:32,008 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:32,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-07 10:58:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:32,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:32,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:32,209 INFO L85 PathProgramCache]: Analyzing trace with hash 713823132, now seen corresponding path program 1 times [2024-11-07 10:58:32,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:32,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729483004] [2024-11-07 10:58:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:32,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:58:32,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-07 10:58:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:32,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 10:58:32,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:33,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:33,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-07 10:58:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-07 10:58:33,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 10:58:33,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:33,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729483004] [2024-11-07 10:58:33,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729483004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:58:33,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:58:33,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 10:58:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119104168] [2024-11-07 10:58:33,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:58:33,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 10:58:33,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:33,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 10:58:33,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 10:58:33,088 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:34,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:36,905 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:58:38,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.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:58:42,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:58:42,341 INFO L93 Difference]: Finished difference Result 207 states and 285 transitions. [2024-11-07 10:58:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 10:58:42,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-07 10:58:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:58:42,344 INFO L225 Difference]: With dead ends: 207 [2024-11-07 10:58:42,344 INFO L226 Difference]: Without dead ends: 105 [2024-11-07 10:58:42,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 10:58:42,344 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 98 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:58:42,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 381 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-07 10:58:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-07 10:58:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2024-11-07 10:58:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 10:58:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-11-07 10:58:42,350 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 117 [2024-11-07 10:58:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:58:42,351 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-11-07 10:58:42,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 10:58:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-11-07 10:58:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 10:58:42,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:58:42,352 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 10:58:42,374 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 (10)] Forceful destruction successful, exit code 0 [2024-11-07 10:58:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:42,553 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:58:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:58:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 899307348, now seen corresponding path program 1 times [2024-11-07 10:58:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 10:58:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255348424] [2024-11-07 10:58:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:58:42,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 10:58:42,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 10:58:42,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 10:58:42,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-07 10:58:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:58:43,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 10:58:43,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 10:58:43,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:43,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-07 10:58:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-07 10:58:43,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 10:58:44,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 10:58:44,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-07 10:58:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 10:58:44,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 10:58:44,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255348424] [2024-11-07 10:58:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255348424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 10:58:44,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 10:58:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-07 10:58:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747218890] [2024-11-07 10:58:44,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 10:58:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:58:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 10:58:44,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:58:44,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:58:44,070 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 10:58:46,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 10:58:50,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []