./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:46:14,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:46:14,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:46:14,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:46:14,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:46:14,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:46:14,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:46:14,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:46:14,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:46:14,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:46:14,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:46:14,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:46:14,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:46:14,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:46:14,421 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:46:14,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:46:14,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:46:14,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:46:14,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:46:14,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:46:14,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:46:14,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:46:14,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:46:14,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:46:14,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:46:14,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:46:14,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:46:14,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:46:14,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:46:14,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:46:14,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:46:14,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:46:14,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:46:14,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:46:14,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:46:14,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:46:14,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:46:14,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:46:14,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:46:14,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:46:14,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:46:14,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:46:14,431 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e [2024-11-16 18:46:14,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:46:14,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:46:14,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:46:14,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:46:14,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:46:14,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-11-16 18:46:16,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:46:16,408 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:46:16,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-11-16 18:46:16,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416114a5a/9a58f5f775614dcf8b74a21226d36239/FLAG434eed85e [2024-11-16 18:46:16,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416114a5a/9a58f5f775614dcf8b74a21226d36239 [2024-11-16 18:46:16,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:46:16,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:46:16,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:46:16,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:46:16,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:46:16,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:46:16" (1/1) ... [2024-11-16 18:46:16,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a119cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:16, skipping insertion in model container [2024-11-16 18:46:16,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:46:16" (1/1) ... [2024-11-16 18:46:16,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:46:16,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i[916,929] [2024-11-16 18:46:17,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:46:17,039 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:46:17,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i[916,929] [2024-11-16 18:46:17,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:46:17,113 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:46:17,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17 WrapperNode [2024-11-16 18:46:17,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:46:17,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:46:17,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:46:17,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:46:17,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,170 INFO L138 Inliner]: procedures = 30, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-16 18:46:17,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:46:17,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:46:17,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:46:17,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:46:17,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,201 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:46:17,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:46:17,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:46:17,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:46:17,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:46:17,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (1/1) ... [2024-11-16 18:46:17,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:46:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:46:17,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:46:17,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:46:17,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:46:17,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:46:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:46:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:46:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:46:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:46:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:46:17,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:46:17,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:46:17,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:46:17,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:46:17,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:46:17,479 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:46:17,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:46:18,052 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1; [2024-11-16 18:46:18,096 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-16 18:46:18,097 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:46:18,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:46:18,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:46:18,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:46:18 BoogieIcfgContainer [2024-11-16 18:46:18,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:46:18,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:46:18,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:46:18,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:46:18,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:46:16" (1/3) ... [2024-11-16 18:46:18,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8b443f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:46:18, skipping insertion in model container [2024-11-16 18:46:18,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:17" (2/3) ... [2024-11-16 18:46:18,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8b443f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:46:18, skipping insertion in model container [2024-11-16 18:46:18,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:46:18" (3/3) ... [2024-11-16 18:46:18,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i [2024-11-16 18:46:18,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:46:18,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:46:18,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:46:18,207 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;@e5fca4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:46:18,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:46:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:46:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:46:18,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:18,225 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:18,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:18,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1595339270, now seen corresponding path program 1 times [2024-11-16 18:46:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:18,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993020566] [2024-11-16 18:46:18,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:18,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:18,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993020566] [2024-11-16 18:46:18,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993020566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:18,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:18,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:46:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688680219] [2024-11-16 18:46:18,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:18,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:46:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:46:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:46:18,810 INFO L87 Difference]: Start difference. First operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:46:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:18,844 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2024-11-16 18:46:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:46:18,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-11-16 18:46:18,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:18,852 INFO L225 Difference]: With dead ends: 192 [2024-11-16 18:46:18,853 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 18:46:18,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:46:18,859 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-16 18:46:18,860 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-16 18:46:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 18:46:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-16 18:46:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:46:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-16 18:46:18,903 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2024-11-16 18:46:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:18,904 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-16 18:46:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:46:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-16 18:46:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:46:18,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:18,908 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:18,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:46:18,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:18,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2004261656, now seen corresponding path program 1 times [2024-11-16 18:46:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655937008] [2024-11-16 18:46:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655937008] [2024-11-16 18:46:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655937008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:46:19,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417210124] [2024-11-16 18:46:19,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:19,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:46:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:46:19,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:46:19,969 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:20,333 INFO L93 Difference]: Finished difference Result 281 states and 407 transitions. [2024-11-16 18:46:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:46:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-16 18:46:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:20,338 INFO L225 Difference]: With dead ends: 281 [2024-11-16 18:46:20,339 INFO L226 Difference]: Without dead ends: 189 [2024-11-16 18:46:20,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:20,341 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 103 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:20,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 299 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:46:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-16 18:46:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2024-11-16 18:46:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 117 states have internal predecessors, (152), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:46:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 224 transitions. [2024-11-16 18:46:20,385 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 224 transitions. Word has length 136 [2024-11-16 18:46:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:20,387 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 224 transitions. [2024-11-16 18:46:20,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 224 transitions. [2024-11-16 18:46:20,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:46:20,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:20,391 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:20,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:46:20,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1832576262, now seen corresponding path program 1 times [2024-11-16 18:46:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:20,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794944568] [2024-11-16 18:46:20,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794944568] [2024-11-16 18:46:21,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794944568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:21,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:21,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:46:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481480126] [2024-11-16 18:46:21,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:21,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:46:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:46:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:21,285 INFO L87 Difference]: Start difference. First operand 156 states and 224 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:21,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:21,627 INFO L93 Difference]: Finished difference Result 312 states and 452 transitions. [2024-11-16 18:46:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:21,628 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:46:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:21,630 INFO L225 Difference]: With dead ends: 312 [2024-11-16 18:46:21,631 INFO L226 Difference]: Without dead ends: 220 [2024-11-16 18:46:21,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:46:21,632 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:21,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 461 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:46:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-16 18:46:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 191. [2024-11-16 18:46:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 152 states have internal predecessors, (205), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:46:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2024-11-16 18:46:21,655 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 143 [2024-11-16 18:46:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:21,656 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2024-11-16 18:46:21,657 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2024-11-16 18:46:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:46:21,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:21,659 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:46:21,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1539173255, now seen corresponding path program 1 times [2024-11-16 18:46:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862366197] [2024-11-16 18:46:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862366197] [2024-11-16 18:46:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862366197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:22,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:46:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208893529] [2024-11-16 18:46:22,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:22,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:46:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:22,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:46:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:46:22,777 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:23,438 INFO L93 Difference]: Finished difference Result 376 states and 544 transitions. [2024-11-16 18:46:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:46:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:46:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:23,441 INFO L225 Difference]: With dead ends: 376 [2024-11-16 18:46:23,441 INFO L226 Difference]: Without dead ends: 263 [2024-11-16 18:46:23,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:46:23,443 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 208 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:23,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 514 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:46:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-16 18:46:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2024-11-16 18:46:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 142 states have internal predecessors, (191), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:46:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 263 transitions. [2024-11-16 18:46:23,466 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 263 transitions. Word has length 143 [2024-11-16 18:46:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:23,466 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 263 transitions. [2024-11-16 18:46:23,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 263 transitions. [2024-11-16 18:46:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:46:23,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:23,469 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:23,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:46:23,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:23,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:23,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1745982923, now seen corresponding path program 1 times [2024-11-16 18:46:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:23,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774324427] [2024-11-16 18:46:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:23,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774324427] [2024-11-16 18:46:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774324427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:24,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:46:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847822495] [2024-11-16 18:46:24,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:24,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:46:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:46:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:24,867 INFO L87 Difference]: Start difference. First operand 181 states and 263 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:46:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:25,303 INFO L93 Difference]: Finished difference Result 383 states and 559 transitions. [2024-11-16 18:46:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-16 18:46:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:25,307 INFO L225 Difference]: With dead ends: 383 [2024-11-16 18:46:25,307 INFO L226 Difference]: Without dead ends: 260 [2024-11-16 18:46:25,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 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-16 18:46:25,309 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 68 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:25,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 427 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:46:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-16 18:46:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 256. [2024-11-16 18:46:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 214 states have (on average 1.3831775700934579) internal successors, (296), 215 states have internal predecessors, (296), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:46:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 372 transitions. [2024-11-16 18:46:25,364 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 372 transitions. Word has length 146 [2024-11-16 18:46:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:25,366 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 372 transitions. [2024-11-16 18:46:25,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:46:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 372 transitions. [2024-11-16 18:46:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:46:25,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:25,368 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:46:25,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:25,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:25,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1304219892, now seen corresponding path program 1 times [2024-11-16 18:46:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973901937] [2024-11-16 18:46:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:27,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973901937] [2024-11-16 18:46:27,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973901937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:27,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:27,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:46:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852748220] [2024-11-16 18:46:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:27,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:46:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:46:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:27,289 INFO L87 Difference]: Start difference. First operand 256 states and 372 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:27,726 INFO L93 Difference]: Finished difference Result 555 states and 801 transitions. [2024-11-16 18:46:27,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-16 18:46:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:27,732 INFO L225 Difference]: With dead ends: 555 [2024-11-16 18:46:27,732 INFO L226 Difference]: Without dead ends: 386 [2024-11-16 18:46:27,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:46:27,734 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 71 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:27,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 647 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:46:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-16 18:46:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 382. [2024-11-16 18:46:27,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 326 states have (on average 1.3803680981595092) internal successors, (450), 329 states have internal predecessors, (450), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 18:46:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 550 transitions. [2024-11-16 18:46:27,780 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 550 transitions. Word has length 146 [2024-11-16 18:46:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:27,780 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 550 transitions. [2024-11-16 18:46:27,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 550 transitions. [2024-11-16 18:46:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:46:27,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:27,784 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:27,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:46:27,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:27,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:27,785 INFO L85 PathProgramCache]: Analyzing trace with hash 629415149, now seen corresponding path program 1 times [2024-11-16 18:46:27,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:27,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30284386] [2024-11-16 18:46:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30284386] [2024-11-16 18:46:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30284386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:28,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:46:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984991753] [2024-11-16 18:46:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:46:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:46:28,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:28,068 INFO L87 Difference]: Start difference. First operand 382 states and 550 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:28,422 INFO L93 Difference]: Finished difference Result 787 states and 1133 transitions. [2024-11-16 18:46:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:28,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:46:28,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:28,425 INFO L225 Difference]: With dead ends: 787 [2024-11-16 18:46:28,425 INFO L226 Difference]: Without dead ends: 504 [2024-11-16 18:46:28,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 18:46:28,427 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 58 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:28,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 480 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:46:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-16 18:46:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 494. [2024-11-16 18:46:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 430 states have (on average 1.369767441860465) internal successors, (589), 435 states have internal predecessors, (589), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 701 transitions. [2024-11-16 18:46:28,466 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 701 transitions. Word has length 147 [2024-11-16 18:46:28,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:28,466 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 701 transitions. [2024-11-16 18:46:28,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 701 transitions. [2024-11-16 18:46:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:46:28,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:28,469 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:28,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:46:28,470 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:28,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash 118880972, now seen corresponding path program 1 times [2024-11-16 18:46:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:28,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131713851] [2024-11-16 18:46:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131713851] [2024-11-16 18:46:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131713851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:28,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:28,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:46:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450504484] [2024-11-16 18:46:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:46:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:46:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:28,806 INFO L87 Difference]: Start difference. First operand 494 states and 701 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:29,035 INFO L93 Difference]: Finished difference Result 897 states and 1268 transitions. [2024-11-16 18:46:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:29,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:46:29,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:29,038 INFO L225 Difference]: With dead ends: 897 [2024-11-16 18:46:29,038 INFO L226 Difference]: Without dead ends: 502 [2024-11-16 18:46:29,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:29,041 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 102 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:29,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 356 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:46:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-16 18:46:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 494. [2024-11-16 18:46:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 430 states have (on average 1.3488372093023255) internal successors, (580), 435 states have internal predecessors, (580), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 692 transitions. [2024-11-16 18:46:29,080 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 692 transitions. Word has length 147 [2024-11-16 18:46:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:29,081 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 692 transitions. [2024-11-16 18:46:29,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 692 transitions. [2024-11-16 18:46:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:46:29,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:29,083 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:29,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:46:29,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash -725590899, now seen corresponding path program 1 times [2024-11-16 18:46:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198974011] [2024-11-16 18:46:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:29,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:29,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198974011] [2024-11-16 18:46:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198974011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:29,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:46:29,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484877960] [2024-11-16 18:46:29,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:29,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:46:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:29,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:46:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:29,404 INFO L87 Difference]: Start difference. First operand 494 states and 692 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:29,625 INFO L93 Difference]: Finished difference Result 883 states and 1238 transitions. [2024-11-16 18:46:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:46:29,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:46:29,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:29,629 INFO L225 Difference]: With dead ends: 883 [2024-11-16 18:46:29,629 INFO L226 Difference]: Without dead ends: 501 [2024-11-16 18:46:29,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:29,631 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 88 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:29,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 358 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:46:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-16 18:46:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 498. [2024-11-16 18:46:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 434 states have (on average 1.3456221198156681) internal successors, (584), 439 states have internal predecessors, (584), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:46:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 696 transitions. [2024-11-16 18:46:29,666 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 696 transitions. Word has length 147 [2024-11-16 18:46:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:29,667 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 696 transitions. [2024-11-16 18:46:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 696 transitions. [2024-11-16 18:46:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:46:29,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:29,669 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:29,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:46:29,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:29,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash -596508180, now seen corresponding path program 1 times [2024-11-16 18:46:29,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:29,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218593323] [2024-11-16 18:46:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:29,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:29,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218593323] [2024-11-16 18:46:29,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218593323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:29,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:29,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:46:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978324480] [2024-11-16 18:46:29,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:29,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:46:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:46:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:29,977 INFO L87 Difference]: Start difference. First operand 498 states and 696 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:30,271 INFO L93 Difference]: Finished difference Result 955 states and 1327 transitions. [2024-11-16 18:46:30,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:46:30,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:46:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:30,274 INFO L225 Difference]: With dead ends: 955 [2024-11-16 18:46:30,274 INFO L226 Difference]: Without dead ends: 569 [2024-11-16 18:46:30,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:30,276 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 53 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:30,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 373 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:46:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-16 18:46:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 403. [2024-11-16 18:46:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 343 states have (on average 1.3323615160349853) internal successors, (457), 346 states have internal predecessors, (457), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 18:46:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 561 transitions. [2024-11-16 18:46:30,304 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 561 transitions. Word has length 147 [2024-11-16 18:46:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:30,304 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 561 transitions. [2024-11-16 18:46:30,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 561 transitions. [2024-11-16 18:46:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:46:30,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:30,306 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:30,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:46:30,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -154880436, now seen corresponding path program 1 times [2024-11-16 18:46:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335022187] [2024-11-16 18:46:30,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335022187] [2024-11-16 18:46:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335022187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:46:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375028722] [2024-11-16 18:46:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:30,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:46:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:46:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:30,540 INFO L87 Difference]: Start difference. First operand 403 states and 561 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:30,590 INFO L93 Difference]: Finished difference Result 730 states and 1011 transitions. [2024-11-16 18:46:30,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:46:30,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:46:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:30,593 INFO L225 Difference]: With dead ends: 730 [2024-11-16 18:46:30,593 INFO L226 Difference]: Without dead ends: 419 [2024-11-16 18:46:30,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:46:30,594 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:30,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:46:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-16 18:46:30,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 413. [2024-11-16 18:46:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 353 states have (on average 1.3229461756373937) internal successors, (467), 356 states have internal predecessors, (467), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 18:46:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 571 transitions. [2024-11-16 18:46:30,620 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 571 transitions. Word has length 149 [2024-11-16 18:46:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:30,620 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 571 transitions. [2024-11-16 18:46:30,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 571 transitions. [2024-11-16 18:46:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:46:30,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:30,624 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:46:30,627 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 652038476, now seen corresponding path program 1 times [2024-11-16 18:46:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762767991] [2024-11-16 18:46:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:46:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:46:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:46:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:46:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:46:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:46:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:46:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:46:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:46:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:46:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:46:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:46:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:46:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:46:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:46:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:46:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:46:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:46:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:46:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762767991] [2024-11-16 18:46:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762767991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:33,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:46:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118342323] [2024-11-16 18:46:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:33,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:46:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:46:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:46:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:46:33,526 INFO L87 Difference]: Start difference. First operand 413 states and 571 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:35,945 INFO L93 Difference]: Finished difference Result 1145 states and 1563 transitions. [2024-11-16 18:46:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:46:35,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:46:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:35,952 INFO L225 Difference]: With dead ends: 1145 [2024-11-16 18:46:35,952 INFO L226 Difference]: Without dead ends: 824 [2024-11-16 18:46:35,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:46:35,954 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 213 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:35,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 859 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 18:46:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2024-11-16 18:46:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 748. [2024-11-16 18:46:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 653 states have (on average 1.321592649310873) internal successors, (863), 660 states have internal predecessors, (863), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-16 18:46:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1023 transitions. [2024-11-16 18:46:36,020 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1023 transitions. Word has length 149 [2024-11-16 18:46:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:36,020 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1023 transitions. [2024-11-16 18:46:36,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1023 transitions. [2024-11-16 18:46:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:46:36,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:36,022 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:36,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:46:36,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:36,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash 623409325, now seen corresponding path program 1 times [2024-11-16 18:46:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:46:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638953034] [2024-11-16 18:46:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:46:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:46:36,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:46:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:46:36,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:46:36,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:46:36,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:46:36,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:46:36,270 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:36,341 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:46:36,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:46:36 BoogieIcfgContainer [2024-11-16 18:46:36,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:46:36,344 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:46:36,344 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:46:36,344 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:46:36,345 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:46:18" (3/4) ... [2024-11-16 18:46:36,349 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:46:36,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:46:36,350 INFO L158 Benchmark]: Toolchain (without parser) took 19570.05ms. Allocated memory was 157.3MB in the beginning and 635.4MB in the end (delta: 478.2MB). Free memory was 124.5MB in the beginning and 329.7MB in the end (delta: -205.2MB). Peak memory consumption was 271.9MB. Max. memory is 16.1GB. [2024-11-16 18:46:36,351 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:46:36,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.08ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 107.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 18:46:36,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.96ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 103.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:46:36,351 INFO L158 Benchmark]: Boogie Preprocessor took 67.26ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 100.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:46:36,351 INFO L158 Benchmark]: IcfgBuilder took 880.23ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 101.2MB in the end (delta: -846.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 18:46:36,352 INFO L158 Benchmark]: TraceAbstraction took 18221.52ms. Allocated memory was 157.3MB in the beginning and 635.4MB in the end (delta: 478.2MB). Free memory was 101.0MB in the beginning and 329.7MB in the end (delta: -228.7MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. [2024-11-16 18:46:36,352 INFO L158 Benchmark]: Witness Printer took 5.71ms. Allocated memory is still 635.4MB. Free memory is still 329.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:46:36,354 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.20ms. Allocated memory is still 157.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.08ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 107.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.96ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 103.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.26ms. Allocated memory is still 157.3MB. Free memory was 103.8MB in the beginning and 100.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 880.23ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 101.2MB in the end (delta: -846.7kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18221.52ms. Allocated memory was 157.3MB in the beginning and 635.4MB in the end (delta: 478.2MB). Free memory was 101.0MB in the beginning and 329.7MB in the end (delta: -228.7MB). Peak memory consumption was 251.5MB. Max. memory is 16.1GB. * Witness Printer took 5.71ms. Allocated memory is still 635.4MB. Free memory is still 329.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 119. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L53] signed char last_1_WrapperStruct00_var_1_9 = 64; [L54] signed char last_1_WrapperStruct00_var_1_14 = -64; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L115] EXPR WrapperStruct00.var_1_9 [L115] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L116] EXPR WrapperStruct00.var_1_14 [L116] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L105] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L127] RET updateVariables() [L128] CALL step() [L58] EXPR WrapperStruct00.var_1_6 [L58] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L59] COND TRUE ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9) [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=257] [L60] COND TRUE (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && stepLocal_0 [L61] WrapperStruct00.var_1_1 = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] EXPR WrapperStruct00.var_1_15 [L68] EXPR WrapperStruct00.var_1_16 [L68] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] signed long int stepLocal_3 = (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))); [L69] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_3=18] [L69] COND TRUE WrapperStruct00.var_1_12 < stepLocal_3 [L70] EXPR WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_13 [L70] WrapperStruct00.var_1_14 = ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13) [L74] WrapperStruct00.var_1_17 = 128.91f [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned char stepLocal_2 = WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_5 [L76] unsigned char stepLocal_1 = WrapperStruct00.var_1_5; [L77] stepLocal_1 && WrapperStruct00.var_1_4 [L77] EXPR WrapperStruct00.var_1_4 [L77] stepLocal_1 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_2=0] [L77] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_4) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_13 [L82] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 [L119] EXPR WrapperStruct00.var_1_6 [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) [L119] EXPR WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) [L119] EXPR WrapperStruct00.var_1_14 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) [L119] EXPR WrapperStruct00.var_1_17 [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119-L120] return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.1s, OverallIterations: 13, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1022 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1021 mSDsluCounter, 5565 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4048 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2941 IncrementalHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 1517 mSDtfsCounter, 2941 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 581 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=748occurred in iteration=12, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 421 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1885 NumberOfCodeBlocks, 1885 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1724 ConstructedInterpolants, 0 QuantifiedInterpolants, 10015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 7344/7344 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-16 18:46:36,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:46:38,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:46:38,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:46:38,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:46:38,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:46:38,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:46:38,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:46:38,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:46:38,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:46:38,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:46:38,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:46:38,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:46:38,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:46:38,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:46:38,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:46:38,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:46:38,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:46:38,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:46:38,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:46:38,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:46:38,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:46:38,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:46:38,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:46:38,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:46:38,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:46:38,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:46:38,752 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:46:38,753 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:46:38,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:46:38,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:46:38,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:46:38,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:46:38,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:46:38,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:46:38,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:46:38,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:46:38,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:46:38,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:46:38,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:46:38,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:46:38,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:46:38,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:46:38,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:46:38,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:46:38,758 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 3555ba030faa46cc93354bed1e80ecee9aa6a6bf15f1b98ede8c01390cd3073e [2024-11-16 18:46:39,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:46:39,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:46:39,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:46:39,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:46:39,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:46:39,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-11-16 18:46:40,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:46:40,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:46:40,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2024-11-16 18:46:40,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88dcaf30/c615a436b66548e09852a4f533a99027/FLAG6292db042 [2024-11-16 18:46:41,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88dcaf30/c615a436b66548e09852a4f533a99027 [2024-11-16 18:46:41,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:46:41,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:46:41,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:46:41,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:46:41,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:46:41,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6633da6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41, skipping insertion in model container [2024-11-16 18:46:41,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:46:41,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i[916,929] [2024-11-16 18:46:41,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:46:41,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:46:41,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i[916,929] [2024-11-16 18:46:41,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:46:41,651 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:46:41,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41 WrapperNode [2024-11-16 18:46:41,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:46:41,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:46:41,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:46:41,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:46:41,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,738 INFO L138 Inliner]: procedures = 34, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2024-11-16 18:46:41,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:46:41,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:46:41,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:46:41,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:46:41,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,792 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-16 18:46:41,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:46:41,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:46:41,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:46:41,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:46:41,847 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (1/1) ... [2024-11-16 18:46:41,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:46:41,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:46:41,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:46:41,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:46:41,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:46:41,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:46:41,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:46:41,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-16 18:46:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-16 18:46:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:46:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:46:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-16 18:46:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-16 18:46:41,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:46:41,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:46:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-16 18:46:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-16 18:46:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:46:41,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:46:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:46:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:46:41,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:46:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:46:42,056 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:46:42,058 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:46:42,626 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1; [2024-11-16 18:46:42,669 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-16 18:46:42,669 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:46:42,686 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:46:42,687 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:46:42,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:46:42 BoogieIcfgContainer [2024-11-16 18:46:42,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:46:42,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:46:42,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:46:42,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:46:42,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:46:41" (1/3) ... [2024-11-16 18:46:42,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440eafa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:46:42, skipping insertion in model container [2024-11-16 18:46:42,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:46:41" (2/3) ... [2024-11-16 18:46:42,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440eafa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:46:42, skipping insertion in model container [2024-11-16 18:46:42,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:46:42" (3/3) ... [2024-11-16 18:46:42,698 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i [2024-11-16 18:46:42,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:46:42,716 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:46:42,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:46:42,786 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;@b69e0ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:46:42,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:46:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:46:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:46:42,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:42,804 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:42,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:42,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash 10532688, now seen corresponding path program 1 times [2024-11-16 18:46:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984645219] [2024-11-16 18:46:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:42,826 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-16 18:46:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:42,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-16 18:46:42,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:43,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:46:43,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-16 18:46:43,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:43,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:43,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984645219] [2024-11-16 18:46:43,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984645219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:43,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:43,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:46:43,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068442524] [2024-11-16 18:46:43,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:46:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:43,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:46:43,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:46:43,184 INFO L87 Difference]: Start difference. First operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:46:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:43,212 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2024-11-16 18:46:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:46:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-11-16 18:46:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:43,220 INFO L225 Difference]: With dead ends: 192 [2024-11-16 18:46:43,220 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 18:46:43,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-16 18:46:43,227 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-16 18:46:43,228 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-16 18:46:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 18:46:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-16 18:46:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:46:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-16 18:46:43,273 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2024-11-16 18:46:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:43,274 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-16 18:46:43,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:46:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-16 18:46:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:46:43,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:43,277 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:43,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:43,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-16 18:46:43,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:43,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -398389698, now seen corresponding path program 1 times [2024-11-16 18:46:43,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088275599] [2024-11-16 18:46:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:43,486 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-16 18:46:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:43,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-16 18:46:43,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:43,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:46:43,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:43,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:43,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:43,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088275599] [2024-11-16 18:46:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088275599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:43,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:46:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857499795] [2024-11-16 18:46:43,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:46:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:46:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:43,858 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:43,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:43,934 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2024-11-16 18:46:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:46:43,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-16 18:46:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:43,938 INFO L225 Difference]: With dead ends: 192 [2024-11-16 18:46:43,938 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 18:46:43,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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-16 18:46:43,948 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:43,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:46:43,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 18:46:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-16 18:46:43,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:46:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-16 18:46:43,964 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2024-11-16 18:46:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:43,966 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-16 18:46:43,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-16 18:46:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:46:43,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:43,969 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:43,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 18:46:44,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-16 18:46:44,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:44,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -369760547, now seen corresponding path program 1 times [2024-11-16 18:46:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:44,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418814725] [2024-11-16 18:46:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:44,174 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-16 18:46:44,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:44,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-16 18:46:44,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:44,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:46:44,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:44,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2024-11-16 18:46:44,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 125 [2024-11-16 18:46:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:45,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:45,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:45,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418814725] [2024-11-16 18:46:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418814725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:46:45,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480139390] [2024-11-16 18:46:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:45,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:46:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:46:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:46:45,415 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:46,481 INFO L93 Difference]: Finished difference Result 293 states and 419 transitions. [2024-11-16 18:46:46,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:46:46,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-16 18:46:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:46,484 INFO L225 Difference]: With dead ends: 293 [2024-11-16 18:46:46,484 INFO L226 Difference]: Without dead ends: 197 [2024-11-16 18:46:46,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:46:46,486 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 76 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:46,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 326 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:46:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-16 18:46:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 160. [2024-11-16 18:46:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:46:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 228 transitions. [2024-11-16 18:46:46,520 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 228 transitions. Word has length 136 [2024-11-16 18:46:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:46,521 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 228 transitions. [2024-11-16 18:46:46,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 228 transitions. [2024-11-16 18:46:46,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:46:46,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:46,523 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:46,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:46,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-16 18:46:46,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash 936311636, now seen corresponding path program 1 times [2024-11-16 18:46:46,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:46,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287676162] [2024-11-16 18:46:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:46,727 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-16 18:46:46,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:46,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-16 18:46:46,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:46,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-16 18:46:46,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:47,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-16 18:46:47,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:46:47,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:47,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 39 [2024-11-16 18:46:47,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:47,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2024-11-16 18:46:47,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:47,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 65 [2024-11-16 18:46:48,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:48,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 68 [2024-11-16 18:46:48,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:48,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 78 [2024-11-16 18:46:48,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:48,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 82 treesize of output 81 [2024-11-16 18:46:49,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:49,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 115 treesize of output 111 [2024-11-16 18:46:49,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:49,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 111 treesize of output 101 [2024-11-16 18:46:49,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2024-11-16 18:46:50,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:50,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 123 [2024-11-16 18:46:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 465 proven. 75 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-16 18:46:50,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:46:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:50,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287676162] [2024-11-16 18:46:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287676162] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:46:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:46:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [21] total 26 [2024-11-16 18:46:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932312529] [2024-11-16 18:46:50,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:46:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:46:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-16 18:46:50,901 INFO L87 Difference]: Start difference. First operand 160 states and 228 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:51,607 INFO L93 Difference]: Finished difference Result 408 states and 579 transitions. [2024-11-16 18:46:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:46:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:46:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:51,611 INFO L225 Difference]: With dead ends: 408 [2024-11-16 18:46:51,611 INFO L226 Difference]: Without dead ends: 312 [2024-11-16 18:46:51,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-11-16 18:46:51,613 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 309 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:51,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 414 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:46:51,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-16 18:46:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2024-11-16 18:46:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 242 states have (on average 1.3471074380165289) internal successors, (326), 244 states have internal predecessors, (326), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 18:46:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2024-11-16 18:46:51,644 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 143 [2024-11-16 18:46:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:51,645 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2024-11-16 18:46:51,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2024-11-16 18:46:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:46:51,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:51,651 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:51,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:51,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-16 18:46:51,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:51,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 642908629, now seen corresponding path program 1 times [2024-11-16 18:46:51,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:51,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669033457] [2024-11-16 18:46:51,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:51,853 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-16 18:46:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:51,856 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-16 18:46:51,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:52,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:46:52,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:52,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2024-11-16 18:46:52,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 123 [2024-11-16 18:46:52,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-16 18:46:52,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-16 18:46:52,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-16 18:46:52,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:52,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2024-11-16 18:46:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:52,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:46:52,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:52,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669033457] [2024-11-16 18:46:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669033457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:46:52,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:46:52,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:46:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794948049] [2024-11-16 18:46:52,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:52,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:46:52,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:46:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:46:52,769 INFO L87 Difference]: Start difference. First operand 290 states and 410 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:55,893 INFO L93 Difference]: Finished difference Result 681 states and 959 transitions. [2024-11-16 18:46:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:46:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:46:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:55,900 INFO L225 Difference]: With dead ends: 681 [2024-11-16 18:46:55,900 INFO L226 Difference]: Without dead ends: 477 [2024-11-16 18:46:55,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:46:55,902 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 206 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:55,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 587 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 18:46:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-16 18:46:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 310. [2024-11-16 18:46:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 264 states have internal predecessors, (353), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 18:46:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2024-11-16 18:46:55,959 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 143 [2024-11-16 18:46:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:55,960 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2024-11-16 18:46:55,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2024-11-16 18:46:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:46:55,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:55,963 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:55,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:56,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-16 18:46:56,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash 527487411, now seen corresponding path program 1 times [2024-11-16 18:46:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350128438] [2024-11-16 18:46:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:56,171 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-16 18:46:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:56,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-16 18:46:56,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:56,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-16 18:46:56,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:56,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-16 18:46:56,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:46:56,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:56,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-11-16 18:46:56,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:56,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2024-11-16 18:46:56,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:56,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 64 [2024-11-16 18:46:57,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:57,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 77 [2024-11-16 18:46:57,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:57,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-16 18:46:57,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:57,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-11-16 18:46:57,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:57,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 88 [2024-11-16 18:46:58,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:58,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 91 [2024-11-16 18:46:58,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2024-11-16 18:46:58,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:58,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 108 [2024-11-16 18:46:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 479 proven. 42 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-16 18:46:58,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:46:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:46:58,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:46:58,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350128438] [2024-11-16 18:46:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350128438] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:46:58,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:46:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2024-11-16 18:46:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879777259] [2024-11-16 18:46:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:46:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:46:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:46:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:46:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:46:58,863 INFO L87 Difference]: Start difference. First operand 310 states and 437 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:46:59,171 INFO L93 Difference]: Finished difference Result 647 states and 904 transitions. [2024-11-16 18:46:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:46:59,172 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:46:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:46:59,175 INFO L225 Difference]: With dead ends: 647 [2024-11-16 18:46:59,175 INFO L226 Difference]: Without dead ends: 435 [2024-11-16 18:46:59,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-11-16 18:46:59,177 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 66 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:46:59,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 556 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:46:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-16 18:46:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 378. [2024-11-16 18:46:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 330 states have internal predecessors, (438), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:46:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 526 transitions. [2024-11-16 18:46:59,203 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 526 transitions. Word has length 143 [2024-11-16 18:46:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:46:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 526 transitions. [2024-11-16 18:46:59,204 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:46:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 526 transitions. [2024-11-16 18:46:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:46:59,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:46:59,206 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:46:59,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-16 18:46:59,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:46:59,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:46:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash 16953234, now seen corresponding path program 1 times [2024-11-16 18:46:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:46:59,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574245207] [2024-11-16 18:46:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:46:59,408 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-16 18:46:59,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:46:59,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-16 18:46:59,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:46:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:46:59,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-16 18:46:59,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:46:59,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:46:59,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:46:59,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:59,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:46:59,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:59,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:46:59,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:59,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:46:59,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:46:59,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:47:00,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:47:00,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2024-11-16 18:47:00,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 38 [2024-11-16 18:47:00,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2024-11-16 18:47:00,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2024-11-16 18:47:00,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2024-11-16 18:47:00,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:00,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 73 treesize of output 87 [2024-11-16 18:47:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 195 proven. 48 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-16 18:47:00,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:47:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:00,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574245207] [2024-11-16 18:47:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574245207] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:47:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:47:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2024-11-16 18:47:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615417185] [2024-11-16 18:47:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:00,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:47:00,828 INFO L87 Difference]: Start difference. First operand 378 states and 526 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:01,058 INFO L93 Difference]: Finished difference Result 898 states and 1254 transitions. [2024-11-16 18:47:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:01,058 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:47:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:01,061 INFO L225 Difference]: With dead ends: 898 [2024-11-16 18:47:01,061 INFO L226 Difference]: Without dead ends: 625 [2024-11-16 18:47:01,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:47:01,063 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 121 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:01,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 255 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:47:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-16 18:47:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 467. [2024-11-16 18:47:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 416 states have (on average 1.3701923076923077) internal successors, (570), 419 states have internal predecessors, (570), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:47:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 658 transitions. [2024-11-16 18:47:01,090 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 658 transitions. Word has length 143 [2024-11-16 18:47:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:01,090 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 658 transitions. [2024-11-16 18:47:01,090 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 658 transitions. [2024-11-16 18:47:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:47:01,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:01,093 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:01,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-16 18:47:01,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-16 18:47:01,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:01,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:01,294 INFO L85 PathProgramCache]: Analyzing trace with hash 905291829, now seen corresponding path program 1 times [2024-11-16 18:47:01,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:01,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926222473] [2024-11-16 18:47:01,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:01,295 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-16 18:47:01,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:01,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-16 18:47:01,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:47:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:01,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 18:47:01,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:01,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2024-11-16 18:47:01,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 122 [2024-11-16 18:47:02,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-16 18:47:02,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2024-11-16 18:47:02,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-16 18:47:02,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-16 18:47:02,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:02,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 48 [2024-11-16 18:47:02,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:02,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 91 [2024-11-16 18:47:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:02,412 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:02,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:02,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926222473] [2024-11-16 18:47:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926222473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:47:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804681964] [2024-11-16 18:47:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:47:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:02,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:47:02,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:47:02,421 INFO L87 Difference]: Start difference. First operand 467 states and 658 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:03,964 INFO L93 Difference]: Finished difference Result 973 states and 1370 transitions. [2024-11-16 18:47:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:47:03,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:47:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:03,969 INFO L225 Difference]: With dead ends: 973 [2024-11-16 18:47:03,969 INFO L226 Difference]: Without dead ends: 678 [2024-11-16 18:47:03,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:47:03,971 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 164 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:03,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 607 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 18:47:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-16 18:47:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 460. [2024-11-16 18:47:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 409 states have (on average 1.36919315403423) internal successors, (560), 412 states have internal predecessors, (560), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-16 18:47:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 648 transitions. [2024-11-16 18:47:04,003 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 648 transitions. Word has length 143 [2024-11-16 18:47:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:04,004 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 648 transitions. [2024-11-16 18:47:04,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 648 transitions. [2024-11-16 18:47:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:47:04,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:04,006 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:04,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:47:04,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-16 18:47:04,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:04,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1064307062, now seen corresponding path program 1 times [2024-11-16 18:47:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667292029] [2024-11-16 18:47:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:04,209 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-16 18:47:04,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:04,212 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-16 18:47:04,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:47:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:04,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 18:47:04,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:04,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-16 18:47:04,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:47:04,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:47:04,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-16 18:47:04,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-16 18:47:04,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:04,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 25 [2024-11-16 18:47:04,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:04,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 25 [2024-11-16 18:47:04,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:04,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2024-11-16 18:47:04,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:04,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 123 treesize of output 59 [2024-11-16 18:47:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-16 18:47:04,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:04,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:04,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667292029] [2024-11-16 18:47:04,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667292029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:04,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:04,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:47:04,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293772226] [2024-11-16 18:47:04,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:04,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:47:04,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:47:04,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:47:04,782 INFO L87 Difference]: Start difference. First operand 460 states and 648 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:47:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:05,740 INFO L93 Difference]: Finished difference Result 908 states and 1273 transitions. [2024-11-16 18:47:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:47:05,740 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), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2024-11-16 18:47:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:05,743 INFO L225 Difference]: With dead ends: 908 [2024-11-16 18:47:05,743 INFO L226 Difference]: Without dead ends: 613 [2024-11-16 18:47:05,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:47:05,747 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 285 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:05,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 443 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:47:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-16 18:47:05,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 609. [2024-11-16 18:47:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 542 states have (on average 1.348708487084871) internal successors, (731), 547 states have internal predecessors, (731), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 18:47:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 847 transitions. [2024-11-16 18:47:05,787 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 847 transitions. Word has length 146 [2024-11-16 18:47:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:05,788 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 847 transitions. [2024-11-16 18:47:05,788 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), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:47:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 847 transitions. [2024-11-16 18:47:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:47:05,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:05,797 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:05,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 18:47:05,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-16 18:47:05,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1644320263, now seen corresponding path program 1 times [2024-11-16 18:47:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:06,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448238637] [2024-11-16 18:47:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:06,000 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-16 18:47:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:06,003 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-16 18:47:06,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:47:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:06,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:47:06,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:06,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:06,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448238637] [2024-11-16 18:47:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448238637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:06,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465816090] [2024-11-16 18:47:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:06,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:06,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:06,231 INFO L87 Difference]: Start difference. First operand 609 states and 847 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:06,491 INFO L93 Difference]: Finished difference Result 1048 states and 1458 transitions. [2024-11-16 18:47:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:47:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:47:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:06,496 INFO L225 Difference]: With dead ends: 1048 [2024-11-16 18:47:06,496 INFO L226 Difference]: Without dead ends: 602 [2024-11-16 18:47:06,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-16 18:47:06,499 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 51 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:06,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 475 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:47:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-16 18:47:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 595. [2024-11-16 18:47:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 528 states have (on average 1.3352272727272727) internal successors, (705), 533 states have internal predecessors, (705), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 18:47:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 821 transitions. [2024-11-16 18:47:06,545 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 821 transitions. Word has length 147 [2024-11-16 18:47:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 821 transitions. [2024-11-16 18:47:06,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 821 transitions. [2024-11-16 18:47:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:47:06,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:06,547 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:06,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-16 18:47:06,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-16 18:47:06,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:06,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -358017319, now seen corresponding path program 1 times [2024-11-16 18:47:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:06,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431724296] [2024-11-16 18:47:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:06,749 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-16 18:47:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:06,751 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-16 18:47:06,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-16 18:47:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:06,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 18:47:06,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:06,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:06,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431724296] [2024-11-16 18:47:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431724296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:47:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815725878] [2024-11-16 18:47:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:47:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:06,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:47:06,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:47:06,919 INFO L87 Difference]: Start difference. First operand 595 states and 821 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:06,954 INFO L93 Difference]: Finished difference Result 957 states and 1328 transitions. [2024-11-16 18:47:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:47:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:47:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:06,958 INFO L225 Difference]: With dead ends: 957 [2024-11-16 18:47:06,958 INFO L226 Difference]: Without dead ends: 520 [2024-11-16 18:47:06,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 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-16 18:47:06,959 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:06,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-11-16 18:47:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2024-11-16 18:47:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 456 states have (on average 1.3223684210526316) internal successors, (603), 460 states have internal predecessors, (603), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:47:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 715 transitions. [2024-11-16 18:47:06,991 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 715 transitions. Word has length 147 [2024-11-16 18:47:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 715 transitions. [2024-11-16 18:47:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 715 transitions. [2024-11-16 18:47:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:47:06,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:06,993 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:07,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-16 18:47:07,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-16 18:47:07,194 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:07,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2137992197, now seen corresponding path program 1 times [2024-11-16 18:47:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094113806] [2024-11-16 18:47:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:07,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:47:07,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:07,196 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-16 18:47:07,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 18:47:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:07,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:47:07,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:07,449 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:07,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:07,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094113806] [2024-11-16 18:47:07,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094113806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:07,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:07,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485148832] [2024-11-16 18:47:07,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:07,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:07,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:07,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:07,453 INFO L87 Difference]: Start difference. First operand 520 states and 715 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:07,729 INFO L93 Difference]: Finished difference Result 887 states and 1226 transitions. [2024-11-16 18:47:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:47:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:07,732 INFO L225 Difference]: With dead ends: 887 [2024-11-16 18:47:07,732 INFO L226 Difference]: Without dead ends: 525 [2024-11-16 18:47:07,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-16 18:47:07,734 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 44 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:07,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 450 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:47:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-16 18:47:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 522. [2024-11-16 18:47:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 458 states have (on average 1.3209606986899562) internal successors, (605), 462 states have internal predecessors, (605), 56 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 18:47:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2024-11-16 18:47:07,766 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 147 [2024-11-16 18:47:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:07,767 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2024-11-16 18:47:07,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2024-11-16 18:47:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:47:07,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:07,769 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:07,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-16 18:47:07,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-16 18:47:07,969 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:07,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:07,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2008909478, now seen corresponding path program 1 times [2024-11-16 18:47:07,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:07,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144672187] [2024-11-16 18:47:07,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:07,970 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-16 18:47:07,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:07,971 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-16 18:47:07,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-16 18:47:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:08,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:47:08,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:08,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:08,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144672187] [2024-11-16 18:47:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144672187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013129437] [2024-11-16 18:47:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:08,185 INFO L87 Difference]: Start difference. First operand 522 states and 717 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:08,425 INFO L93 Difference]: Finished difference Result 904 states and 1235 transitions. [2024-11-16 18:47:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:08,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:47:08,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:08,429 INFO L225 Difference]: With dead ends: 904 [2024-11-16 18:47:08,429 INFO L226 Difference]: Without dead ends: 540 [2024-11-16 18:47:08,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-16 18:47:08,433 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 53 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:08,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 376 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:47:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-16 18:47:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 499. [2024-11-16 18:47:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 434 states have (on average 1.3018433179723503) internal successors, (565), 437 states have internal predecessors, (565), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 18:47:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 673 transitions. [2024-11-16 18:47:08,473 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 673 transitions. Word has length 147 [2024-11-16 18:47:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:08,473 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 673 transitions. [2024-11-16 18:47:08,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 673 transitions. [2024-11-16 18:47:08,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:47:08,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:08,475 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:08,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-16 18:47:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-16 18:47:08,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:08,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1076342906, now seen corresponding path program 1 times [2024-11-16 18:47:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608598936] [2024-11-16 18:47:08,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:08,678 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-16 18:47:08,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:08,681 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-16 18:47:08,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Waiting until timeout for monitored process [2024-11-16 18:47:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:08,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:47:08,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:08,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:08,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608598936] [2024-11-16 18:47:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608598936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:08,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:47:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419470300] [2024-11-16 18:47:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:08,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:47:08,938 INFO L87 Difference]: Start difference. First operand 499 states and 673 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:09,221 INFO L93 Difference]: Finished difference Result 925 states and 1243 transitions. [2024-11-16 18:47:09,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:47:09,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:47:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:09,225 INFO L225 Difference]: With dead ends: 925 [2024-11-16 18:47:09,225 INFO L226 Difference]: Without dead ends: 584 [2024-11-16 18:47:09,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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-16 18:47:09,226 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 33 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:09,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 380 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:47:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-16 18:47:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 538. [2024-11-16 18:47:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 473 states have (on average 1.2980972515856237) internal successors, (614), 476 states have internal predecessors, (614), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 18:47:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 722 transitions. [2024-11-16 18:47:09,270 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 722 transitions. Word has length 149 [2024-11-16 18:47:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:09,270 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 722 transitions. [2024-11-16 18:47:09,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 722 transitions. [2024-11-16 18:47:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:47:09,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:09,273 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:09,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (15)] Ended with exit code 0 [2024-11-16 18:47:09,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-16 18:47:09,474 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:09,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1854632667, now seen corresponding path program 1 times [2024-11-16 18:47:09,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069688906] [2024-11-16 18:47:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:09,475 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-16 18:47:09,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:09,476 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-16 18:47:09,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Waiting until timeout for monitored process [2024-11-16 18:47:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:09,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 18:47:09,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:47:09,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:09,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 57 [2024-11-16 18:47:10,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:10,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 53 [2024-11-16 18:47:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:10,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:10,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069688906] [2024-11-16 18:47:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069688906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:10,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:10,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:47:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816046793] [2024-11-16 18:47:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:47:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:47:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:47:10,145 INFO L87 Difference]: Start difference. First operand 538 states and 722 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:11,057 INFO L93 Difference]: Finished difference Result 557 states and 743 transitions. [2024-11-16 18:47:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:47:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:47:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:11,059 INFO L225 Difference]: With dead ends: 557 [2024-11-16 18:47:11,059 INFO L226 Difference]: Without dead ends: 554 [2024-11-16 18:47:11,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:47:11,060 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 269 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:11,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 635 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:47:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-16 18:47:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 550. [2024-11-16 18:47:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 485 states have (on average 1.2907216494845362) internal successors, (626), 488 states have internal predecessors, (626), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 18:47:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 734 transitions. [2024-11-16 18:47:11,101 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 734 transitions. Word has length 149 [2024-11-16 18:47:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:11,102 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 734 transitions. [2024-11-16 18:47:11,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 734 transitions. [2024-11-16 18:47:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:47:11,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:11,103 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:11,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (16)] Ended with exit code 0 [2024-11-16 18:47:11,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/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-16 18:47:11,304 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:11,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1883261818, now seen corresponding path program 1 times [2024-11-16 18:47:11,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:11,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625134118] [2024-11-16 18:47:11,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:11,305 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-16 18:47:11,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:11,306 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/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-16 18:47:11,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (17)] Waiting until timeout for monitored process [2024-11-16 18:47:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:11,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-16 18:47:11,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:11,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:47:11,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:47:11,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:47:11,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:11,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 46 [2024-11-16 18:47:12,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:12,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 64 [2024-11-16 18:47:12,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:12,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 68 [2024-11-16 18:47:12,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:12,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 102 treesize of output 95 [2024-11-16 18:47:12,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:12,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 176 treesize of output 88 [2024-11-16 18:47:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 315 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-16 18:47:13,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:47:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:13,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:13,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625134118] [2024-11-16 18:47:13,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625134118] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:47:13,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:47:13,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [23] total 25 [2024-11-16 18:47:13,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332850180] [2024-11-16 18:47:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:13,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:47:13,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:13,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:47:13,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-16 18:47:13,245 INFO L87 Difference]: Start difference. First operand 550 states and 734 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:14,049 INFO L93 Difference]: Finished difference Result 1367 states and 1815 transitions. [2024-11-16 18:47:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:47:14,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:47:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:14,054 INFO L225 Difference]: With dead ends: 1367 [2024-11-16 18:47:14,055 INFO L226 Difference]: Without dead ends: 992 [2024-11-16 18:47:14,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2024-11-16 18:47:14,057 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 77 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:14,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 597 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:47:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2024-11-16 18:47:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 988. [2024-11-16 18:47:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 885 states have (on average 1.2836158192090394) internal successors, (1136), 892 states have internal predecessors, (1136), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-16 18:47:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1304 transitions. [2024-11-16 18:47:14,110 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1304 transitions. Word has length 149 [2024-11-16 18:47:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:14,112 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1304 transitions. [2024-11-16 18:47:14,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:14,112 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1304 transitions. [2024-11-16 18:47:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:47:14,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:14,114 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:14,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (17)] Ended with exit code 0 [2024-11-16 18:47:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/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-16 18:47:14,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1149576986, now seen corresponding path program 1 times [2024-11-16 18:47:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604786670] [2024-11-16 18:47:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:14,316 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-16 18:47:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:14,317 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/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-16 18:47:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (18)] Waiting until timeout for monitored process [2024-11-16 18:47:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:14,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:47:14,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:14,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:47:14,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604786670] [2024-11-16 18:47:14,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604786670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:47:14,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:47:14,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:47:14,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535151678] [2024-11-16 18:47:14,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:14,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:47:14,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:47:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:47:14,510 INFO L87 Difference]: Start difference. First operand 988 states and 1304 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:14,599 INFO L93 Difference]: Finished difference Result 1737 states and 2298 transitions. [2024-11-16 18:47:14,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:47:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:47:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:14,604 INFO L225 Difference]: With dead ends: 1737 [2024-11-16 18:47:14,604 INFO L226 Difference]: Without dead ends: 1020 [2024-11-16 18:47:14,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 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-16 18:47:14,606 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:14,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:47:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-11-16 18:47:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1008. [2024-11-16 18:47:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 905 states have (on average 1.2773480662983425) internal successors, (1156), 912 states have internal predecessors, (1156), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-16 18:47:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1324 transitions. [2024-11-16 18:47:14,668 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1324 transitions. Word has length 149 [2024-11-16 18:47:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:14,669 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1324 transitions. [2024-11-16 18:47:14,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1324 transitions. [2024-11-16 18:47:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 18:47:14,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:14,671 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:14,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (18)] Ended with exit code 0 [2024-11-16 18:47:14,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/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-16 18:47:14,872 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:14,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash -975379811, now seen corresponding path program 1 times [2024-11-16 18:47:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:14,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569032334] [2024-11-16 18:47:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:14,873 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-16 18:47:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:14,874 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/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-16 18:47:14,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (19)] Waiting until timeout for monitored process [2024-11-16 18:47:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:15,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-16 18:47:15,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:15,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-16 18:47:15,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-16 18:47:15,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-16 18:47:15,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2024-11-16 18:47:16,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:16,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2024-11-16 18:47:17,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 78 [2024-11-16 18:47:18,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:18,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 51 [2024-11-16 18:47:18,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:18,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 78 [2024-11-16 18:47:20,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:20,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 42 [2024-11-16 18:47:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 411 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-16 18:47:20,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:47:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:21,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569032334] [2024-11-16 18:47:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569032334] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:47:21,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:47:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [33] total 39 [2024-11-16 18:47:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386497361] [2024-11-16 18:47:21,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:21,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:47:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:47:21,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 18:47:21,616 INFO L87 Difference]: Start difference. First operand 1008 states and 1324 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:22,876 INFO L93 Difference]: Finished difference Result 2213 states and 2907 transitions. [2024-11-16 18:47:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:47:22,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-11-16 18:47:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:22,883 INFO L225 Difference]: With dead ends: 2213 [2024-11-16 18:47:22,883 INFO L226 Difference]: Without dead ends: 1476 [2024-11-16 18:47:22,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 262 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=286, Invalid=1436, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 18:47:22,886 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 128 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:22,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 596 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 18:47:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-11-16 18:47:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1268. [2024-11-16 18:47:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1165 states have (on average 1.2944206008583692) internal successors, (1508), 1172 states have internal predecessors, (1508), 84 states have call successors, (84), 18 states have call predecessors, (84), 18 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-16 18:47:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1676 transitions. [2024-11-16 18:47:22,966 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1676 transitions. Word has length 151 [2024-11-16 18:47:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:22,966 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1676 transitions. [2024-11-16 18:47:22,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1676 transitions. [2024-11-16 18:47:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 18:47:22,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:22,972 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:22,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (19)] Ended with exit code 0 [2024-11-16 18:47:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/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-16 18:47:23,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:23,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -846297092, now seen corresponding path program 1 times [2024-11-16 18:47:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000184563] [2024-11-16 18:47:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:23,173 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-16 18:47:23,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:23,175 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/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-16 18:47:23,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (20)] Waiting until timeout for monitored process [2024-11-16 18:47:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:23,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 18:47:23,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:23,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-16 18:47:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-16 18:47:23,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-16 18:47:23,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:23,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-11-16 18:47:23,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:23,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 44 [2024-11-16 18:47:23,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 44 [2024-11-16 18:47:23,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:23,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 71 [2024-11-16 18:47:24,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:47:24,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 81 treesize of output 35 [2024-11-16 18:47:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 305 proven. 15 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-16 18:47:24,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:47:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:47:24,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:47:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000184563] [2024-11-16 18:47:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000184563] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:47:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:47:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-16 18:47:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059486974] [2024-11-16 18:47:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:47:24,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:47:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:47:24,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:47:24,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:47:24,349 INFO L87 Difference]: Start difference. First operand 1268 states and 1676 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:47:24,717 INFO L93 Difference]: Finished difference Result 2705 states and 3565 transitions. [2024-11-16 18:47:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:47:24,717 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-11-16 18:47:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:47:24,722 INFO L225 Difference]: With dead ends: 2705 [2024-11-16 18:47:24,722 INFO L226 Difference]: Without dead ends: 1812 [2024-11-16 18:47:24,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:47:24,724 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 80 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:47:24,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 317 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:47:24,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2024-11-16 18:47:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1644. [2024-11-16 18:47:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1519 states have (on average 1.292955892034233) internal successors, (1964), 1528 states have internal predecessors, (1964), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 91 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 18:47:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2164 transitions. [2024-11-16 18:47:24,807 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2164 transitions. Word has length 151 [2024-11-16 18:47:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:47:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2164 transitions. [2024-11-16 18:47:24,808 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:47:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2164 transitions. [2024-11-16 18:47:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-16 18:47:24,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:47:24,823 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:47:24,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (20)] Ended with exit code 0 [2024-11-16 18:47:25,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/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-16 18:47:25,023 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:47:25,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:47:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash -944950121, now seen corresponding path program 1 times [2024-11-16 18:47:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:47:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763837076] [2024-11-16 18:47:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:47:25,025 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-16 18:47:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:47:25,028 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/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-16 18:47:25,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (21)] Waiting until timeout for monitored process [2024-11-16 18:47:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:47:25,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 18:47:25,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:47:25,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-16 18:47:25,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2024-11-16 18:47:25,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27