./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3dbbec33 Calling Ultimate with: /usr/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/forester-heap/dll-01-2.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.graphml --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 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 11:00:04,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 11:00:04,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 11:00:04,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 11:00:04,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 11:00:04,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 11:00:04,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 11:00:04,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 11:00:04,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 11:00:04,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 11:00:04,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 11:00:04,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 11:00:04,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 11:00:04,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 11:00:04,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 11:00:04,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 11:00:04,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 11:00:04,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 11:00:04,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 11:00:04,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 11:00:04,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 11:00:04,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 11:00:04,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 11:00:04,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 11:00:04,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 11:00:04,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 11:00:04,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 11:00:04,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 11:00:04,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 11:00:04,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 11:00:04,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 11:00:04,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 11:00:04,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 11:00:04,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 11:00:04,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 11:00:04,535 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 11:00:04,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 11:00:04,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 11:00:04,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 11:00:04,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 11:00:04,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 11:00:04,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 11:00:04,565 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 11:00:04,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 11:00:04,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 11:00:04,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 11:00:04,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 11:00:04,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 11:00:04,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 11:00:04,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 11:00:04,568 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 11:00:04,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 11:00:04,569 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 11:00:04,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 11:00:04,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 11:00:04,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 11:00:04,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 11:00:04,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 11:00:04,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 11:00:04,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 11:00:04,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 11:00:04,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 11:00:04,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 11:00:04,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 11:00:04,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 11:00:04,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 11:00:04,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 11:00:04,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 11:00:04,573 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 11:00:04,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 11:00:04,573 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 11:00:04,573 INFO L138 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.graphml 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 -> 652acbc8fb2d659424086f7ee4bd5fc2f45ff1d49f46cde68db4fdee1ed0638e [2023-02-14 11:00:04,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 11:00:04,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 11:00:04,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 11:00:04,773 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 11:00:04,773 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 11:00:04,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-2.i [2023-02-14 11:00:05,814 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 11:00:05,999 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 11:00:06,000 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i [2023-02-14 11:00:06,026 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b6813fd/c6b32f29dc9544e09d95ed549302b9cb/FLAG409e01e39 [2023-02-14 11:00:06,039 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b6813fd/c6b32f29dc9544e09d95ed549302b9cb [2023-02-14 11:00:06,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 11:00:06,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 11:00:06,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 11:00:06,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 11:00:06,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 11:00:06,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172273f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06, skipping insertion in model container [2023-02-14 11:00:06,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 11:00:06,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 11:00:06,350 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2023-02-14 11:00:06,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2023-02-14 11:00:06,368 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2023-02-14 11:00:06,369 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2023-02-14 11:00:06,372 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2023-02-14 11:00:06,374 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2023-02-14 11:00:06,377 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2023-02-14 11:00:06,378 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2023-02-14 11:00:06,378 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2023-02-14 11:00:06,379 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2023-02-14 11:00:06,382 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2023-02-14 11:00:06,383 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2023-02-14 11:00:06,385 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2023-02-14 11:00:06,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 11:00:06,399 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 11:00:06,443 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22080,22093] [2023-02-14 11:00:06,452 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22353,22366] [2023-02-14 11:00:06,455 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22587,22600] [2023-02-14 11:00:06,458 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22657,22670] [2023-02-14 11:00:06,460 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[22924,22937] [2023-02-14 11:00:06,461 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23032,23045] [2023-02-14 11:00:06,465 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23263,23276] [2023-02-14 11:00:06,471 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23343,23356] [2023-02-14 11:00:06,483 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23422,23435] [2023-02-14 11:00:06,484 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23512,23525] [2023-02-14 11:00:06,484 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23690,23703] [2023-02-14 11:00:06,485 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23768,23781] [2023-02-14 11:00:06,485 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-2.i[23845,23858] [2023-02-14 11:00:06,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 11:00:06,506 INFO L208 MainTranslator]: Completed translation [2023-02-14 11:00:06,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06 WrapperNode [2023-02-14 11:00:06,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 11:00:06,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 11:00:06,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 11:00:06,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 11:00:06,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,554 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2023-02-14 11:00:06,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 11:00:06,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 11:00:06,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 11:00:06,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 11:00:06,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,602 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 11:00:06,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 11:00:06,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 11:00:06,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 11:00:06,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (1/1) ... [2023-02-14 11:00:06,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 11:00:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:00:06,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-14 11:00:06,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-14 11:00:06,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 11:00:06,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 11:00:06,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 11:00:06,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 11:00:06,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 11:00:06,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 11:00:06,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 11:00:06,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 11:00:06,830 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 11:00:06,832 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 11:00:07,150 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 11:00:07,155 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 11:00:07,155 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2023-02-14 11:00:07,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:00:07 BoogieIcfgContainer [2023-02-14 11:00:07,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 11:00:07,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 11:00:07,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 11:00:07,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 11:00:07,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 11:00:06" (1/3) ... [2023-02-14 11:00:07,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418eb8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 11:00:07, skipping insertion in model container [2023-02-14 11:00:07,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 11:00:06" (2/3) ... [2023-02-14 11:00:07,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418eb8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 11:00:07, skipping insertion in model container [2023-02-14 11:00:07,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 11:00:07" (3/3) ... [2023-02-14 11:00:07,163 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2023-02-14 11:00:07,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 11:00:07,175 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-02-14 11:00:07,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 11:00:07,210 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@4145c802, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 11:00:07,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-02-14 11:00:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 11:00:07,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:07,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 11:00:07,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:07,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2023-02-14 11:00:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:07,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870669606] [2023-02-14 11:00:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:07,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:07,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:07,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870669606] [2023-02-14 11:00:07,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870669606] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:07,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:07,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 11:00:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039521947] [2023-02-14 11:00:07,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:07,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 11:00:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 11:00:07,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:07,510 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:07,569 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2023-02-14 11:00:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:00:07,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-14 11:00:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:07,581 INFO L225 Difference]: With dead ends: 180 [2023-02-14 11:00:07,581 INFO L226 Difference]: Without dead ends: 95 [2023-02-14 11:00:07,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:07,586 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:07,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-14 11:00:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2023-02-14 11:00:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-14 11:00:07,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2023-02-14 11:00:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:07,613 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-14 11:00:07,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-14 11:00:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 11:00:07,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:07,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:07,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 11:00:07,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2023-02-14 11:00:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:07,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601518930] [2023-02-14 11:00:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:07,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601518930] [2023-02-14 11:00:07,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601518930] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:07,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:07,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 11:00:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143357229] [2023-02-14 11:00:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:07,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 11:00:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 11:00:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:07,659 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:07,677 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-14 11:00:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:00:07,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 11:00:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:07,680 INFO L225 Difference]: With dead ends: 80 [2023-02-14 11:00:07,680 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 11:00:07,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:07,682 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:07,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:07,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 11:00:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-14 11:00:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-02-14 11:00:07,690 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2023-02-14 11:00:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:07,690 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-02-14 11:00:07,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-02-14 11:00:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 11:00:07,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:07,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:07,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 11:00:07,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2023-02-14 11:00:07,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:07,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280992555] [2023-02-14 11:00:07,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:07,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:07,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280992555] [2023-02-14 11:00:07,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280992555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:07,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:07,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 11:00:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787324836] [2023-02-14 11:00:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:07,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 11:00:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 11:00:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:00:07,816 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:07,860 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-02-14 11:00:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 11:00:07,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-14 11:00:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:07,861 INFO L225 Difference]: With dead ends: 80 [2023-02-14 11:00:07,861 INFO L226 Difference]: Without dead ends: 78 [2023-02-14 11:00:07,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:00:07,862 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 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 [2023-02-14 11:00:07,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-14 11:00:07,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-02-14 11:00:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-02-14 11:00:07,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2023-02-14 11:00:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:07,868 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-02-14 11:00:07,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-02-14 11:00:07,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 11:00:07,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:07,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:07,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 11:00:07,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:07,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2023-02-14 11:00:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:07,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677396500] [2023-02-14 11:00:07,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:07,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:08,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677396500] [2023-02-14 11:00:08,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677396500] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:08,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:08,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 11:00:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533053397] [2023-02-14 11:00:08,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:08,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 11:00:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:08,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 11:00:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:00:08,140 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:08,248 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2023-02-14 11:00:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 11:00:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 11:00:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:08,250 INFO L225 Difference]: With dead ends: 195 [2023-02-14 11:00:08,251 INFO L226 Difference]: Without dead ends: 128 [2023-02-14 11:00:08,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:00:08,253 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 55 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:08,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-14 11:00:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2023-02-14 11:00:08,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-02-14 11:00:08,268 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2023-02-14 11:00:08,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:08,268 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-02-14 11:00:08,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,268 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-02-14 11:00:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-14 11:00:08,269 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:08,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:08,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 11:00:08,270 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2023-02-14 11:00:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:08,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915299081] [2023-02-14 11:00:08,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:08,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:08,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915299081] [2023-02-14 11:00:08,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915299081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:08,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:08,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 11:00:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655539479] [2023-02-14 11:00:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:08,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 11:00:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 11:00:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:00:08,522 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:08,605 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2023-02-14 11:00:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 11:00:08,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-14 11:00:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:08,607 INFO L225 Difference]: With dead ends: 122 [2023-02-14 11:00:08,607 INFO L226 Difference]: Without dead ends: 118 [2023-02-14 11:00:08,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 11:00:08,608 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 151 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:08,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 157 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-14 11:00:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2023-02-14 11:00:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2023-02-14 11:00:08,622 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2023-02-14 11:00:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:08,623 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2023-02-14 11:00:08,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2023-02-14 11:00:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 11:00:08,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:08,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:08,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 11:00:08,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2023-02-14 11:00:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:08,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975066822] [2023-02-14 11:00:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:08,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975066822] [2023-02-14 11:00:08,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975066822] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:08,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:08,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 11:00:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423647417] [2023-02-14 11:00:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:08,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 11:00:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:08,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 11:00:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:00:08,674 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:08,727 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2023-02-14 11:00:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 11:00:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 11:00:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:08,729 INFO L225 Difference]: With dead ends: 132 [2023-02-14 11:00:08,729 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 11:00:08,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:00:08,730 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 131 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:08,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 11:00:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2023-02-14 11:00:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-02-14 11:00:08,746 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2023-02-14 11:00:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:08,747 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-02-14 11:00:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-02-14 11:00:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-14 11:00:08,749 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:08,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:08,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 11:00:08,749 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2023-02-14 11:00:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:08,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246196360] [2023-02-14 11:00:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:08,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246196360] [2023-02-14 11:00:08,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246196360] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:08,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:08,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 11:00:08,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948578453] [2023-02-14 11:00:08,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:08,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 11:00:08,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:08,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 11:00:08,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:08,782 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:08,803 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2023-02-14 11:00:08,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:00:08,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-14 11:00:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:08,804 INFO L225 Difference]: With dead ends: 137 [2023-02-14 11:00:08,804 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 11:00:08,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:08,807 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:08,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:08,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 11:00:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-14 11:00:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-02-14 11:00:08,817 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2023-02-14 11:00:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:08,818 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-02-14 11:00:08,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-02-14 11:00:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 11:00:08,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:08,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:08,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 11:00:08,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:08,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2023-02-14 11:00:08,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298128218] [2023-02-14 11:00:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:08,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298128218] [2023-02-14 11:00:08,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298128218] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:08,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:08,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 11:00:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3374676] [2023-02-14 11:00:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:08,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 11:00:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 11:00:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:08,858 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:08,870 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-02-14 11:00:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:00:08,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 11:00:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:08,872 INFO L225 Difference]: With dead ends: 75 [2023-02-14 11:00:08,872 INFO L226 Difference]: Without dead ends: 73 [2023-02-14 11:00:08,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:08,873 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 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 [2023-02-14 11:00:08,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-14 11:00:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-14 11:00:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-02-14 11:00:08,879 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2023-02-14 11:00:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:08,879 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-02-14 11:00:08,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-02-14 11:00:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 11:00:08,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:08,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:08,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 11:00:08,883 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2023-02-14 11:00:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612872192] [2023-02-14 11:00:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:08,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:08,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612872192] [2023-02-14 11:00:08,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612872192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:08,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:08,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 11:00:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100604787] [2023-02-14 11:00:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:08,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 11:00:08,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 11:00:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:00:08,993 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:09,037 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-02-14 11:00:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 11:00:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 11:00:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:09,038 INFO L225 Difference]: With dead ends: 74 [2023-02-14 11:00:09,038 INFO L226 Difference]: Without dead ends: 72 [2023-02-14 11:00:09,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 11:00:09,038 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:09,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-14 11:00:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-02-14 11:00:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-02-14 11:00:09,043 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2023-02-14 11:00:09,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:09,043 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-02-14 11:00:09,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-02-14 11:00:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 11:00:09,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:09,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:09,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 11:00:09,044 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:09,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2023-02-14 11:00:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:09,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033038359] [2023-02-14 11:00:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:09,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033038359] [2023-02-14 11:00:09,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033038359] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:09,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:09,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 11:00:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448516889] [2023-02-14 11:00:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:09,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 11:00:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 11:00:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 11:00:09,128 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:09,279 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2023-02-14 11:00:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 11:00:09,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-14 11:00:09,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:09,280 INFO L225 Difference]: With dead ends: 175 [2023-02-14 11:00:09,280 INFO L226 Difference]: Without dead ends: 133 [2023-02-14 11:00:09,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-14 11:00:09,281 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:09,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 278 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-14 11:00:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2023-02-14 11:00:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-14 11:00:09,286 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2023-02-14 11:00:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:09,287 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-14 11:00:09,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-14 11:00:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 11:00:09,288 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:09,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:09,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-14 11:00:09,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2023-02-14 11:00:09,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:09,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476399306] [2023-02-14 11:00:09,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:09,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:10,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:10,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476399306] [2023-02-14 11:00:10,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476399306] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:10,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:10,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 11:00:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567542783] [2023-02-14 11:00:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:10,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 11:00:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 11:00:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 11:00:10,699 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:11,071 INFO L93 Difference]: Finished difference Result 232 states and 257 transitions. [2023-02-14 11:00:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 11:00:11,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-14 11:00:11,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:11,075 INFO L225 Difference]: With dead ends: 232 [2023-02-14 11:00:11,075 INFO L226 Difference]: Without dead ends: 230 [2023-02-14 11:00:11,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-14 11:00:11,075 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 254 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:11,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 419 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:00:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-14 11:00:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 93. [2023-02-14 11:00:11,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2023-02-14 11:00:11,087 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2023-02-14 11:00:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:11,087 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2023-02-14 11:00:11,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2023-02-14 11:00:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 11:00:11,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:11,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:11,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 11:00:11,091 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:11,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2023-02-14 11:00:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:11,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171217503] [2023-02-14 11:00:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 11:00:11,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:11,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171217503] [2023-02-14 11:00:11,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171217503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:11,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:11,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 11:00:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481870961] [2023-02-14 11:00:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:11,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 11:00:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 11:00:11,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:00:11,165 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:11,262 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2023-02-14 11:00:11,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 11:00:11,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 11:00:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:11,263 INFO L225 Difference]: With dead ends: 140 [2023-02-14 11:00:11,264 INFO L226 Difference]: Without dead ends: 122 [2023-02-14 11:00:11,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-14 11:00:11,264 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 24 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:11,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 234 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-14 11:00:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2023-02-14 11:00:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2023-02-14 11:00:11,280 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2023-02-14 11:00:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:11,280 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2023-02-14 11:00:11,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2023-02-14 11:00:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 11:00:11,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:11,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 11:00:11,283 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2023-02-14 11:00:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:11,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295275257] [2023-02-14 11:00:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 11:00:11,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:11,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295275257] [2023-02-14 11:00:11,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295275257] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:11,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:11,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 11:00:11,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357758524] [2023-02-14 11:00:11,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:11,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 11:00:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:11,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 11:00:11,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:11,330 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:11,369 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2023-02-14 11:00:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:00:11,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 11:00:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:11,370 INFO L225 Difference]: With dead ends: 114 [2023-02-14 11:00:11,371 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 11:00:11,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:11,372 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:11,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 11:00:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-14 11:00:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2023-02-14 11:00:11,398 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2023-02-14 11:00:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:11,399 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2023-02-14 11:00:11,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2023-02-14 11:00:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 11:00:11,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:11,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:11,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 11:00:11,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2023-02-14 11:00:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:11,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822215836] [2023-02-14 11:00:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:12,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:12,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822215836] [2023-02-14 11:00:12,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822215836] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:12,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:12,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 11:00:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547038331] [2023-02-14 11:00:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:12,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 11:00:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:12,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 11:00:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 11:00:12,905 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:13,189 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2023-02-14 11:00:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 11:00:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-14 11:00:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:13,190 INFO L225 Difference]: With dead ends: 266 [2023-02-14 11:00:13,190 INFO L226 Difference]: Without dead ends: 264 [2023-02-14 11:00:13,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-14 11:00:13,191 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:13,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 381 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:00:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-02-14 11:00:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 114. [2023-02-14 11:00:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2023-02-14 11:00:13,209 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2023-02-14 11:00:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:13,209 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2023-02-14 11:00:13,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2023-02-14 11:00:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 11:00:13,210 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:13,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:13,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 11:00:13,211 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:13,211 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2023-02-14 11:00:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:13,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978000683] [2023-02-14 11:00:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:13,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978000683] [2023-02-14 11:00:13,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978000683] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:00:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852042611] [2023-02-14 11:00:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:00:13,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:00:13,322 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:00:13,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-14 11:00:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:13,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 11:00:13,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:00:13,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:13,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-14 11:00:13,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:13,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-14 11:00:13,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:13,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 11:00:13,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:13,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 11:00:13,666 INFO L350 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 15 treesize of output 7 [2023-02-14 11:00:13,669 INFO L350 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 15 treesize of output 7 [2023-02-14 11:00:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:13,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:00:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:13,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852042611] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:00:13,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:00:13,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-14 11:00:13,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295673105] [2023-02-14 11:00:13,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:00:13,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 11:00:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 11:00:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 11:00:13,732 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:13,888 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2023-02-14 11:00:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 11:00:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-14 11:00:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:13,890 INFO L225 Difference]: With dead ends: 201 [2023-02-14 11:00:13,890 INFO L226 Difference]: Without dead ends: 141 [2023-02-14 11:00:13,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-14 11:00:13,892 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 151 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:13,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 164 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-14 11:00:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2023-02-14 11:00:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2023-02-14 11:00:13,913 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2023-02-14 11:00:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:13,915 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2023-02-14 11:00:13,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2023-02-14 11:00:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-14 11:00:13,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:13,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:13,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-14 11:00:14,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 11:00:14,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2023-02-14 11:00:14,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:14,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149705733] [2023-02-14 11:00:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 11:00:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149705733] [2023-02-14 11:00:15,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149705733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:15,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:15,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 11:00:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475280820] [2023-02-14 11:00:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:15,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 11:00:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 11:00:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 11:00:15,172 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:15,478 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2023-02-14 11:00:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 11:00:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-14 11:00:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:15,479 INFO L225 Difference]: With dead ends: 178 [2023-02-14 11:00:15,479 INFO L226 Difference]: Without dead ends: 176 [2023-02-14 11:00:15,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 11:00:15,481 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:15,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 259 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 11:00:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-14 11:00:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 122. [2023-02-14 11:00:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2023-02-14 11:00:15,510 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 29 [2023-02-14 11:00:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:15,510 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2023-02-14 11:00:15,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2023-02-14 11:00:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 11:00:15,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:15,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:15,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 11:00:15,511 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2023-02-14 11:00:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:15,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567660632] [2023-02-14 11:00:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:15,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:15,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567660632] [2023-02-14 11:00:15,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567660632] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:15,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:15,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 11:00:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865427531] [2023-02-14 11:00:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:15,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 11:00:15,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:15,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 11:00:15,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:15,574 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:15,629 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2023-02-14 11:00:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 11:00:15,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 11:00:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:15,631 INFO L225 Difference]: With dead ends: 239 [2023-02-14 11:00:15,631 INFO L226 Difference]: Without dead ends: 178 [2023-02-14 11:00:15,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 11:00:15,633 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:15,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-14 11:00:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 144. [2023-02-14 11:00:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.2158273381294964) internal successors, (169), 143 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-02-14 11:00:15,666 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 31 [2023-02-14 11:00:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:15,666 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-02-14 11:00:15,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-02-14 11:00:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 11:00:15,667 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:15,667 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:15,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-14 11:00:15,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:15,668 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2023-02-14 11:00:15,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:15,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563842689] [2023-02-14 11:00:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563842689] [2023-02-14 11:00:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563842689] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:00:15,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982376706] [2023-02-14 11:00:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:15,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:00:15,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:00:15,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:00:15,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-14 11:00:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:15,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 11:00:15,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:00:15,929 INFO L350 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 16 treesize of output 17 [2023-02-14 11:00:15,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-14 11:00:15,961 INFO L350 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 21 treesize of output 20 [2023-02-14 11:00:15,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-14 11:00:16,045 INFO L350 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 15 treesize of output 7 [2023-02-14 11:00:16,049 INFO L350 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 15 treesize of output 7 [2023-02-14 11:00:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 11:00:16,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:00:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 11:00:16,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982376706] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:00:16,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:00:16,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2023-02-14 11:00:16,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214204446] [2023-02-14 11:00:16,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:00:16,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 11:00:16,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:16,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 11:00:16,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 11:00:16,143 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:16,366 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2023-02-14 11:00:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 11:00:16,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 11:00:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:16,368 INFO L225 Difference]: With dead ends: 254 [2023-02-14 11:00:16,368 INFO L226 Difference]: Without dead ends: 222 [2023-02-14 11:00:16,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-14 11:00:16,368 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 94 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:16,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-14 11:00:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2023-02-14 11:00:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2023-02-14 11:00:16,397 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 32 [2023-02-14 11:00:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:16,397 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2023-02-14 11:00:16,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2023-02-14 11:00:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 11:00:16,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:16,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:16,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-14 11:00:16,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 11:00:16,604 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:16,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:16,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1670306697, now seen corresponding path program 1 times [2023-02-14 11:00:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:16,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231542484] [2023-02-14 11:00:16,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 11:00:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231542484] [2023-02-14 11:00:18,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231542484] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:18,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:18,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 11:00:18,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837114923] [2023-02-14 11:00:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:18,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 11:00:18,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:18,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 11:00:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 11:00:18,145 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:18,352 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2023-02-14 11:00:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 11:00:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-14 11:00:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:18,354 INFO L225 Difference]: With dead ends: 203 [2023-02-14 11:00:18,354 INFO L226 Difference]: Without dead ends: 188 [2023-02-14 11:00:18,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 11:00:18,355 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 138 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:18,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 199 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 11:00:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-14 11:00:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 161. [2023-02-14 11:00:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 160 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:18,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2023-02-14 11:00:18,409 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 32 [2023-02-14 11:00:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:18,410 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2023-02-14 11:00:18,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2023-02-14 11:00:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-14 11:00:18,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:18,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:18,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-14 11:00:18,411 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2023-02-14 11:00:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:18,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060637527] [2023-02-14 11:00:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:18,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:18,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060637527] [2023-02-14 11:00:18,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060637527] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 11:00:18,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 11:00:18,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 11:00:18,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604049423] [2023-02-14 11:00:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 11:00:18,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 11:00:18,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:18,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 11:00:18,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:00:18,515 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:18,583 INFO L93 Difference]: Finished difference Result 223 states and 263 transitions. [2023-02-14 11:00:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 11:00:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-14 11:00:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:18,584 INFO L225 Difference]: With dead ends: 223 [2023-02-14 11:00:18,584 INFO L226 Difference]: Without dead ends: 97 [2023-02-14 11:00:18,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 11:00:18,586 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:18,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 11:00:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-14 11:00:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-02-14 11:00:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-02-14 11:00:18,601 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2023-02-14 11:00:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:18,601 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-02-14 11:00:18,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-02-14 11:00:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 11:00:18,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:18,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:18,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-14 11:00:18,603 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:18,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2023-02-14 11:00:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:18,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41368787] [2023-02-14 11:00:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:19,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41368787] [2023-02-14 11:00:19,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41368787] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:00:19,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136462172] [2023-02-14 11:00:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:19,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:00:19,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:00:19,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:00:19,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-14 11:00:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:19,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 11:00:19,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:00:19,298 INFO L350 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 6 treesize of output 5 [2023-02-14 11:00:19,314 INFO L350 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 13 treesize of output 9 [2023-02-14 11:00:19,318 INFO L350 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 13 treesize of output 9 [2023-02-14 11:00:19,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:19,389 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2023-02-14 11:00:19,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:19,399 INFO L350 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2023-02-14 11:00:19,415 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-02-14 11:00:19,416 INFO L350 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 65 [2023-02-14 11:00:19,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:19,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:19,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:19,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-02-14 11:00:19,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 28 [2023-02-14 11:00:19,447 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 11:00:19,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-14 11:00:19,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 11:00:19,563 INFO L350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-14 11:00:19,570 INFO L350 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 27 treesize of output 27 [2023-02-14 11:00:19,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:19,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-14 11:00:19,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:19,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:00:19,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2023-02-14 11:00:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:19,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:00:22,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:22,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:00:22,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2023-02-14 11:00:22,240 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:22,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:00:22,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2023-02-14 11:00:22,248 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:22,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2023-02-14 11:00:22,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:22,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 11:00:22,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 100 [2023-02-14 11:00:22,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 24 [2023-02-14 11:00:22,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 8 [2023-02-14 11:00:22,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-02-14 11:00:22,271 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:22,274 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 11:00:22,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2023-02-14 11:00:22,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:22,280 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-14 11:00:22,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2023-02-14 11:00:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:22,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136462172] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 11:00:22,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 11:00:22,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2023-02-14 11:00:22,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102079637] [2023-02-14 11:00:22,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 11:00:22,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 11:00:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 11:00:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 11:00:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2023-02-14 11:00:22,316 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 11:00:24,357 INFO L93 Difference]: Finished difference Result 274 states and 313 transitions. [2023-02-14 11:00:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 11:00:24,358 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-14 11:00:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 11:00:24,359 INFO L225 Difference]: With dead ends: 274 [2023-02-14 11:00:24,359 INFO L226 Difference]: Without dead ends: 214 [2023-02-14 11:00:24,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=216, Invalid=651, Unknown=3, NotChecked=0, Total=870 [2023-02-14 11:00:24,360 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 440 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 55 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-14 11:00:24,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 561 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 348 Invalid, 3 Unknown, 0 Unchecked, 1.4s Time] [2023-02-14 11:00:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-14 11:00:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 113. [2023-02-14 11:00:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.18348623853211) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2023-02-14 11:00:24,376 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 36 [2023-02-14 11:00:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 11:00:24,376 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2023-02-14 11:00:24,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 11:00:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2023-02-14 11:00:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 11:00:24,377 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 11:00:24,377 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 11:00:24,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 11:00:24,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:00:24,583 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-02-14 11:00:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 11:00:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash 878042536, now seen corresponding path program 1 times [2023-02-14 11:00:24,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 11:00:24,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464763997] [2023-02-14 11:00:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:24,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 11:00:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 11:00:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464763997] [2023-02-14 11:00:26,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464763997] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 11:00:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340155737] [2023-02-14 11:00:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 11:00:26,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 11:00:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 11:00:26,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 11:00:26,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-14 11:00:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 11:00:27,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-14 11:00:27,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 11:00:27,012 INFO L350 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 6 treesize of output 5 [2023-02-14 11:00:27,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:27,104 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-14 11:00:27,105 INFO L350 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 383 treesize of output 326 [2023-02-14 11:00:27,167 INFO L321 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2023-02-14 11:00:27,168 INFO L350 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 491 treesize of output 404 [2023-02-14 11:00:27,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:27,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:27,242 INFO L321 Elim1Store]: treesize reduction 575, result has 3.8 percent of original size [2023-02-14 11:00:27,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 368 treesize of output 516 [2023-02-14 11:00:27,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:27,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:27,308 INFO L321 Elim1Store]: treesize reduction 404, result has 5.4 percent of original size [2023-02-14 11:00:27,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 393 treesize of output 457 [2023-02-14 11:00:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 107 treesize of output 67 [2023-02-14 11:00:27,327 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:27,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 123 treesize of output 82 [2023-02-14 11:00:27,369 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 11:00:27,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-14 11:00:27,383 INFO L350 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 16 treesize of output 15 [2023-02-14 11:00:27,396 INFO L350 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 16 treesize of output 15 [2023-02-14 11:00:27,407 INFO L350 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 16 treesize of output 15 [2023-02-14 11:00:27,456 INFO L350 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 10 treesize of output 9 [2023-02-14 11:00:27,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-14 11:00:27,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 32 treesize of output 22 [2023-02-14 11:00:27,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:27,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-14 11:00:27,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:27,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:27,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:27,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:27,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 42 treesize of output 78 [2023-02-14 11:00:27,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 42 treesize of output 78 [2023-02-14 11:00:27,753 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:27,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 42 treesize of output 88 [2023-02-14 11:00:27,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:27,774 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:27,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 3 [2023-02-14 11:00:27,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:27,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 42 treesize of output 88 [2023-02-14 11:00:27,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 97 [2023-02-14 11:00:27,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:27,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 104 [2023-02-14 11:00:27,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2023-02-14 11:00:27,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 3 [2023-02-14 11:00:28,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,080 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:28,082 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 11:00:28,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 81 [2023-02-14 11:00:28,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2023-02-14 11:00:28,114 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-02-14 11:00:28,114 INFO L350 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 103 [2023-02-14 11:00:28,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:28,125 INFO L350 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 43 treesize of output 43 [2023-02-14 11:00:28,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 28 [2023-02-14 11:00:28,142 INFO L321 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2023-02-14 11:00:28,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2023-02-14 11:00:28,295 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 11:00:28,296 INFO L350 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 76 [2023-02-14 11:00:28,302 INFO L350 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 43 [2023-02-14 11:00:28,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,702 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 11:00:28,706 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-14 11:00:28,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 85 treesize of output 45 [2023-02-14 11:00:28,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 11:00:28,717 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 11:00:28,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2023-02-14 11:00:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 11:00:28,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 11:00:28,825 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1738))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1739) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8)) 0)) (forall ((v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1739))) (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1738) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 8))) 0)))) is different from false [2023-02-14 11:00:28,881 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| 0))) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_1735 Int)) (or (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1735)))) (let ((.cse3 (select (select (store .cse2 v_ArrVal_1735 v_ArrVal_1719) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (select (let ((.cse0 (store (store .cse2 v_ArrVal_1735 v_ArrVal_1728) .cse3 v_ArrVal_1738))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ 8 (select (select (store (store .cse4 v_ArrVal_1735 v_ArrVal_1721) .cse3 v_ArrVal_1739) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) 0)) (not (= (select |c_#valid| v_ArrVal_1735) 0)))) (forall ((v_ArrVal_1735 Int)) (or (not (= (select |c_#valid| v_ArrVal_1735) 0)) (forall ((v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1719 (Array Int Int)) (v_ArrVal_1728 (Array Int Int)) (v_ArrVal_1739 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (= (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1735)))) (let ((.cse8 (select (select (store .cse7 v_ArrVal_1735 v_ArrVal_1719) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse6 (store (store .cse4 v_ArrVal_1735 v_ArrVal_1721) .cse8 v_ArrVal_1739))) (select (select .cse6 (select (select (store (store .cse7 v_ArrVal_1735 v_ArrVal_1728) .cse8 v_ArrVal_1738) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)) (+ 8 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1)))))) 0)))))) is different from false [2023-02-14 11:00:32,302 INFO L321 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2023-02-14 11:00:32,303 INFO L350 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 35939 treesize of output 26749 [2023-02-14 11:00:41,921 WARN L233 SmtUtils]: Spent 9.59s on a formula simplification. DAG size of input: 46 DAG size of output: 36 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-14 11:00:41,922 INFO L321 Elim1Store]: treesize reduction 62, result has 54.4 percent of original size [2023-02-14 11:00:41,923 INFO L350 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 4 new quantified variables, introduced 7 case distinctions, treesize of input 151115 treesize of output 114109