./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-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/heap-manipulation/merge_sort-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 e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3dbbec3 [2023-02-14 10:54:11,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 10:54:11,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 10:54:11,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 10:54:11,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 10:54:11,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 10:54:11,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 10:54:11,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 10:54:11,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 10:54:11,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 10:54:11,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 10:54:11,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 10:54:11,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 10:54:11,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 10:54:11,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 10:54:11,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 10:54:11,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 10:54:11,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 10:54:11,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 10:54:11,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 10:54:11,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 10:54:11,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 10:54:11,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 10:54:11,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 10:54:11,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 10:54:11,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 10:54:11,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 10:54:11,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 10:54:11,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 10:54:11,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 10:54:11,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 10:54:11,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 10:54:11,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 10:54:11,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 10:54:11,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 10:54:11,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 10:54:11,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 10:54:11,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 10:54:11,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 10:54:11,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 10:54:11,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 10:54:11,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 10:54:11,412 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 10:54:11,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 10:54:11,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 10:54:11,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 10:54:11,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 10:54:11,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 10:54:11,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 10:54:11,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 10:54:11,415 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 10:54:11,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 10:54:11,416 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 10:54:11,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 10:54:11,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 10:54:11,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 10:54:11,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 10:54:11,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 10:54:11,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 10:54:11,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 10:54:11,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:54:11,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 10:54:11,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 10:54:11,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 10:54:11,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 10:54:11,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 10:54:11,419 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 10:54:11,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 10:54:11,419 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 10:54:11,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 10:54:11,419 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 10:54:11,419 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 -> e47f94c757882803b8e19e21a897c3f5ab1653c3391e3b246153a1c416bdab7c [2023-02-14 10:54:11,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 10:54:11,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 10:54:11,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 10:54:11,657 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 10:54:11,657 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 10:54:11,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2023-02-14 10:54:12,695 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 10:54:12,983 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 10:54:12,983 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2023-02-14 10:54:12,991 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9fca93f6/e3bfa5ffdb5d41e3a5bd01aac6498530/FLAG83e2842f6 [2023-02-14 10:54:13,002 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9fca93f6/e3bfa5ffdb5d41e3a5bd01aac6498530 [2023-02-14 10:54:13,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 10:54:13,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 10:54:13,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 10:54:13,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 10:54:13,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 10:54:13,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0ca198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13, skipping insertion in model container [2023-02-14 10:54:13,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 10:54:13,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 10:54:13,191 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/heap-manipulation/merge_sort-2.i[22632,22645] [2023-02-14 10:54:13,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:54:13,217 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 10:54:13,236 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/heap-manipulation/merge_sort-2.i[22632,22645] [2023-02-14 10:54:13,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 10:54:13,289 INFO L208 MainTranslator]: Completed translation [2023-02-14 10:54:13,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13 WrapperNode [2023-02-14 10:54:13,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 10:54:13,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 10:54:13,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 10:54:13,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 10:54:13,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,342 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2023-02-14 10:54:13,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 10:54:13,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 10:54:13,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 10:54:13,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 10:54:13,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,370 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 10:54:13,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 10:54:13,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 10:54:13,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 10:54:13,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (1/1) ... [2023-02-14 10:54:13,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 10:54:13,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:13,420 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 10:54:13,424 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 10:54:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 10:54:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2023-02-14 10:54:13,448 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2023-02-14 10:54:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-14 10:54:13,448 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-14 10:54:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 10:54:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 10:54:13,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 10:54:13,537 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 10:54:13,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 10:54:13,863 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 10:54:13,868 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 10:54:13,868 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2023-02-14 10:54:13,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:54:13 BoogieIcfgContainer [2023-02-14 10:54:13,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 10:54:13,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 10:54:13,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 10:54:13,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 10:54:13,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:54:13" (1/3) ... [2023-02-14 10:54:13,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4477cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:54:13, skipping insertion in model container [2023-02-14 10:54:13,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:54:13" (2/3) ... [2023-02-14 10:54:13,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4477cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:54:13, skipping insertion in model container [2023-02-14 10:54:13,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:54:13" (3/3) ... [2023-02-14 10:54:13,876 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2023-02-14 10:54:13,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 10:54:13,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 10:54:13,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 10:54:13,931 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;@3ca5d532, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 10:54:13,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 10:54:13,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-14 10:54:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-14 10:54:13,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:13,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:13,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2023-02-14 10:54:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:13,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342582664] [2023-02-14 10:54:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,069 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 10:54:14,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:14,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342582664] [2023-02-14 10:54:14,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342582664] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:14,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 10:54:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046481817] [2023-02-14 10:54:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:14,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 10:54:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 10:54:14,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:54:14,116 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:14,141 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2023-02-14 10:54:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 10:54:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-14 10:54:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:14,149 INFO L225 Difference]: With dead ends: 188 [2023-02-14 10:54:14,151 INFO L226 Difference]: Without dead ends: 87 [2023-02-14 10:54:14,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 10:54:14,159 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:14,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:54:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-14 10:54:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-14 10:54:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-02-14 10:54:14,207 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2023-02-14 10:54:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:14,207 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-02-14 10:54:14,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-02-14 10:54:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-14 10:54:14,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:14,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:14,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 10:54:14,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2023-02-14 10:54:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:14,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089625928] [2023-02-14 10:54:14,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,251 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 10:54:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089625928] [2023-02-14 10:54:14,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089625928] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:14,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:14,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 10:54:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319549868] [2023-02-14 10:54:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:14,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 10:54:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 10:54:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 10:54:14,254 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:14,275 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2023-02-14 10:54:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 10:54:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-14 10:54:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:14,277 INFO L225 Difference]: With dead ends: 172 [2023-02-14 10:54:14,277 INFO L226 Difference]: Without dead ends: 93 [2023-02-14 10:54:14,278 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 10:54:14,279 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:14,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:54:14,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-14 10:54:14,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-02-14 10:54:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2023-02-14 10:54:14,287 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2023-02-14 10:54:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:14,287 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2023-02-14 10:54:14,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2023-02-14 10:54:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-14 10:54:14,288 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:14,288 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:14,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 10:54:14,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2023-02-14 10:54:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:14,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660643256] [2023-02-14 10:54:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:14,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660643256] [2023-02-14 10:54:14,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660643256] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:14,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:14,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:54:14,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757246096] [2023-02-14 10:54:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:14,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:54:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:54:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:54:14,407 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:14,554 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2023-02-14 10:54:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:54:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-14 10:54:14,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:14,559 INFO L225 Difference]: With dead ends: 235 [2023-02-14 10:54:14,559 INFO L226 Difference]: Without dead ends: 230 [2023-02-14 10:54:14,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-14 10:54:14,565 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 519 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:14,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 276 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-14 10:54:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 92. [2023-02-14 10:54:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-02-14 10:54:14,590 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2023-02-14 10:54:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:14,590 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-02-14 10:54:14,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-02-14 10:54:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 10:54:14,591 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:14,592 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] [2023-02-14 10:54:14,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 10:54:14,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:14,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2023-02-14 10:54:14,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:14,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855693006] [2023-02-14 10:54:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:14,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:14,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:14,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855693006] [2023-02-14 10:54:14,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855693006] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:14,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:14,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:54:14,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997920556] [2023-02-14 10:54:14,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:54:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:14,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:54:14,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:54:14,745 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:14,867 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2023-02-14 10:54:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:54:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:14,868 INFO L225 Difference]: With dead ends: 94 [2023-02-14 10:54:14,868 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 10:54:14,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:14,876 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 12 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:14,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 319 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 10:54:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-14 10:54:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2023-02-14 10:54:14,894 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2023-02-14 10:54:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:14,895 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2023-02-14 10:54:14,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2023-02-14 10:54:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 10:54:14,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:14,896 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] [2023-02-14 10:54:14,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 10:54:14,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:14,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2023-02-14 10:54:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:14,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814082754] [2023-02-14 10:54:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:15,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814082754] [2023-02-14 10:54:15,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814082754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:15,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:15,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:54:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038240744] [2023-02-14 10:54:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:15,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:54:15,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:15,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:54:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:54:15,024 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:15,144 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2023-02-14 10:54:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:54:15,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:15,148 INFO L225 Difference]: With dead ends: 118 [2023-02-14 10:54:15,148 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 10:54:15,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:15,150 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 39 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:15,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 284 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 10:54:15,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2023-02-14 10:54:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2023-02-14 10:54:15,173 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2023-02-14 10:54:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:15,173 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2023-02-14 10:54:15,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2023-02-14 10:54:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 10:54:15,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:15,175 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] [2023-02-14 10:54:15,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 10:54:15,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:15,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2023-02-14 10:54:15,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:15,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656562400] [2023-02-14 10:54:15,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:15,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656562400] [2023-02-14 10:54:15,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656562400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:15,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:15,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:54:15,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343634263] [2023-02-14 10:54:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:15,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:54:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:54:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:15,352 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:15,521 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2023-02-14 10:54:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:54:15,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:15,522 INFO L225 Difference]: With dead ends: 195 [2023-02-14 10:54:15,522 INFO L226 Difference]: Without dead ends: 192 [2023-02-14 10:54:15,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:54:15,523 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 357 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:15,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 283 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-14 10:54:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2023-02-14 10:54:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2023-02-14 10:54:15,545 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2023-02-14 10:54:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:15,545 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2023-02-14 10:54:15,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2023-02-14 10:54:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 10:54:15,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:15,547 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] [2023-02-14 10:54:15,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-14 10:54:15,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2023-02-14 10:54:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:15,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331179292] [2023-02-14 10:54:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:15,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:15,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331179292] [2023-02-14 10:54:15,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331179292] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:15,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:15,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:54:15,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742317269] [2023-02-14 10:54:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:15,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:54:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:15,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:54:15,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:15,704 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:15,883 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2023-02-14 10:54:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:54:15,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:15,885 INFO L225 Difference]: With dead ends: 194 [2023-02-14 10:54:15,885 INFO L226 Difference]: Without dead ends: 191 [2023-02-14 10:54:15,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:54:15,886 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 354 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:15,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 283 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-14 10:54:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2023-02-14 10:54:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2023-02-14 10:54:15,895 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2023-02-14 10:54:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:15,895 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2023-02-14 10:54:15,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2023-02-14 10:54:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 10:54:15,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:15,896 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] [2023-02-14 10:54:15,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-14 10:54:15,896 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2023-02-14 10:54:15,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:15,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459723911] [2023-02-14 10:54:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:16,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:16,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459723911] [2023-02-14 10:54:16,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459723911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:16,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:16,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 10:54:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035613215] [2023-02-14 10:54:16,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:16,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:54:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:54:16,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:54:16,232 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:16,571 INFO L93 Difference]: Finished difference Result 264 states and 335 transitions. [2023-02-14 10:54:16,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 10:54:16,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:16,573 INFO L225 Difference]: With dead ends: 264 [2023-02-14 10:54:16,573 INFO L226 Difference]: Without dead ends: 261 [2023-02-14 10:54:16,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:54:16,575 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 539 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:16,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 331 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:54:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-02-14 10:54:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 105. [2023-02-14 10:54:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 102 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2023-02-14 10:54:16,599 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2023-02-14 10:54:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:16,600 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2023-02-14 10:54:16,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2023-02-14 10:54:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 10:54:16,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:16,605 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] [2023-02-14 10:54:16,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-14 10:54:16,605 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2023-02-14 10:54:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:16,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292852593] [2023-02-14 10:54:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:16,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:16,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292852593] [2023-02-14 10:54:16,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292852593] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:16,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:16,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 10:54:16,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223551239] [2023-02-14 10:54:16,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:16,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:54:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:16,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:54:16,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:54:16,840 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:17,189 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2023-02-14 10:54:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 10:54:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:17,191 INFO L225 Difference]: With dead ends: 263 [2023-02-14 10:54:17,191 INFO L226 Difference]: Without dead ends: 260 [2023-02-14 10:54:17,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:54:17,193 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 535 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:17,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 331 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:54:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-14 10:54:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 108. [2023-02-14 10:54:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 105 states have internal predecessors, (115), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2023-02-14 10:54:17,229 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2023-02-14 10:54:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:17,230 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2023-02-14 10:54:17,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2023-02-14 10:54:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-14 10:54:17,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:17,232 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-14 10:54:17,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-14 10:54:17,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash -399551200, now seen corresponding path program 1 times [2023-02-14 10:54:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:17,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035830794] [2023-02-14 10:54:17,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035830794] [2023-02-14 10:54:17,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035830794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:17,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74248415] [2023-02-14 10:54:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:17,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:17,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:17,365 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 10:54:17,380 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 10:54:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:17,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 10:54:17,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:17,619 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 31 treesize of output 19 [2023-02-14 10:54:17,623 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 25 treesize of output 13 [2023-02-14 10:54:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:17,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:17,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74248415] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:54:17,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:54:17,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-02-14 10:54:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216733162] [2023-02-14 10:54:17,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:17,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:54:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:54:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:17,729 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:17,803 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2023-02-14 10:54:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:54:17,804 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:17,805 INFO L225 Difference]: With dead ends: 110 [2023-02-14 10:54:17,805 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 10:54:17,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-14 10:54:17,805 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 76 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:17,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 172 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:54:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 10:54:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-14 10:54:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.202127659574468) internal successors, (113), 103 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2023-02-14 10:54:17,819 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2023-02-14 10:54:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:17,819 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2023-02-14 10:54:17,819 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2023-02-14 10:54:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 10:54:17,820 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:17,820 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] [2023-02-14 10:54:17,838 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 10:54:18,038 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,SelfDestructingSolverStorable9 [2023-02-14 10:54:18,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511860, now seen corresponding path program 1 times [2023-02-14 10:54:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392254006] [2023-02-14 10:54:18,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:18,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392254006] [2023-02-14 10:54:18,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392254006] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:18,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:18,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:54:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485196862] [2023-02-14 10:54:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:18,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:54:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:54:18,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:18,085 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:18,141 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2023-02-14 10:54:18,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:54:18,142 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 10:54:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:18,142 INFO L225 Difference]: With dead ends: 146 [2023-02-14 10:54:18,142 INFO L226 Difference]: Without dead ends: 143 [2023-02-14 10:54:18,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-14 10:54:18,143 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 272 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:18,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 325 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:54:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-14 10:54:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2023-02-14 10:54:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 107 states have internal predecessors, (118), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2023-02-14 10:54:18,158 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2023-02-14 10:54:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:18,158 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2023-02-14 10:54:18,158 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2023-02-14 10:54:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 10:54:18,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:18,159 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 10:54:18,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-14 10:54:18,159 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -236025208, now seen corresponding path program 1 times [2023-02-14 10:54:18,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:18,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875430981] [2023-02-14 10:54:18,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:18,381 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 10:54:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:18,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875430981] [2023-02-14 10:54:18,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875430981] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026757197] [2023-02-14 10:54:18,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:18,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:18,397 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 10:54:18,399 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 10:54:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:18,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-14 10:54:18,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:18,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:18,525 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 10:54:18,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:18,532 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 10:54:18,646 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 10:54:18,650 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 10:54:18,653 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 10:54:18,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:18,737 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 10:54:18,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026757197] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:54:18,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:54:18,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2023-02-14 10:54:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092788858] [2023-02-14 10:54:18,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:18,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 10:54:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 10:54:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:54:18,739 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:18,943 INFO L93 Difference]: Finished difference Result 210 states and 249 transitions. [2023-02-14 10:54:18,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 10:54:18,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 10:54:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:18,944 INFO L225 Difference]: With dead ends: 210 [2023-02-14 10:54:18,944 INFO L226 Difference]: Without dead ends: 207 [2023-02-14 10:54:18,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:54:18,945 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 120 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:18,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 528 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:54:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-14 10:54:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2023-02-14 10:54:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 162 states have (on average 1.1728395061728396) internal successors, (190), 171 states have internal predecessors, (190), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2023-02-14 10:54:18,966 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 36 [2023-02-14 10:54:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:18,966 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2023-02-14 10:54:18,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2023-02-14 10:54:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 10:54:18,967 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:18,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:18,974 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 10:54:19,172 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,SelfDestructingSolverStorable11 [2023-02-14 10:54:19,172 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash -73182163, now seen corresponding path program 1 times [2023-02-14 10:54:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:19,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947857349] [2023-02-14 10:54:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 10:54:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947857349] [2023-02-14 10:54:19,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947857349] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826845347] [2023-02-14 10:54:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:19,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:19,379 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 10:54:19,400 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 10:54:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:19,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-14 10:54:19,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:19,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:19,482 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 10:54:19,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:19,486 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 10:54:19,518 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 19 treesize of output 7 [2023-02-14 10:54:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 10:54:19,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-14 10:54:19,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826845347] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:54:19,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:54:19,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2023-02-14 10:54:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526694256] [2023-02-14 10:54:19,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:19,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-14 10:54:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-14 10:54:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:54:19,579 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:19,817 INFO L93 Difference]: Finished difference Result 293 states and 359 transitions. [2023-02-14 10:54:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 10:54:19,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-14 10:54:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:19,819 INFO L225 Difference]: With dead ends: 293 [2023-02-14 10:54:19,819 INFO L226 Difference]: Without dead ends: 205 [2023-02-14 10:54:19,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-02-14 10:54:19,819 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 290 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:19,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 422 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 10:54:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-14 10:54:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 140. [2023-02-14 10:54:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.171875) internal successors, (150), 137 states have internal predecessors, (150), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2023-02-14 10:54:19,837 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 38 [2023-02-14 10:54:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:19,837 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2023-02-14 10:54:19,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2023-02-14 10:54:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-14 10:54:19,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:19,838 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:19,842 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 10:54:20,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:20,043 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash 490774160, now seen corresponding path program 1 times [2023-02-14 10:54:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220423110] [2023-02-14 10:54:20,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:20,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220423110] [2023-02-14 10:54:20,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220423110] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:20,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:20,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 10:54:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321864797] [2023-02-14 10:54:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:20,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 10:54:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 10:54:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:20,099 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:20,182 INFO L93 Difference]: Finished difference Result 248 states and 308 transitions. [2023-02-14 10:54:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 10:54:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-14 10:54:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:20,184 INFO L225 Difference]: With dead ends: 248 [2023-02-14 10:54:20,184 INFO L226 Difference]: Without dead ends: 207 [2023-02-14 10:54:20,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:54:20,184 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 352 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:20,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 379 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:54:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-14 10:54:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 141. [2023-02-14 10:54:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.1705426356589148) internal successors, (151), 138 states have internal predecessors, (151), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2023-02-14 10:54:20,216 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 38 [2023-02-14 10:54:20,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:20,216 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2023-02-14 10:54:20,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2023-02-14 10:54:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 10:54:20,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:20,217 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, 1, 1, 1] [2023-02-14 10:54:20,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-14 10:54:20,218 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash -557560351, now seen corresponding path program 1 times [2023-02-14 10:54:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:20,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521269584] [2023-02-14 10:54:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:20,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521269584] [2023-02-14 10:54:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521269584] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:20,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:20,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-14 10:54:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310513892] [2023-02-14 10:54:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:54:20,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:20,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:54:20,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-14 10:54:20,325 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:20,488 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2023-02-14 10:54:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 10:54:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-14 10:54:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:20,489 INFO L225 Difference]: With dead ends: 185 [2023-02-14 10:54:20,489 INFO L226 Difference]: Without dead ends: 182 [2023-02-14 10:54:20,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-02-14 10:54:20,490 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 269 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:20,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 288 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-14 10:54:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2023-02-14 10:54:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 144 states have internal predecessors, (158), 10 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-14 10:54:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2023-02-14 10:54:20,508 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 39 [2023-02-14 10:54:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:20,508 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2023-02-14 10:54:20,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2023-02-14 10:54:20,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-14 10:54:20,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:20,509 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:20,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-14 10:54:20,509 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:20,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191262, now seen corresponding path program 1 times [2023-02-14 10:54:20,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:20,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695860618] [2023-02-14 10:54:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:20,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:20,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695860618] [2023-02-14 10:54:20,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695860618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:20,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:20,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-14 10:54:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981631093] [2023-02-14 10:54:20,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 10:54:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:20,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 10:54:20,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-14 10:54:20,614 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:20,896 INFO L93 Difference]: Finished difference Result 326 states and 425 transitions. [2023-02-14 10:54:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 10:54:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-02-14 10:54:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:20,898 INFO L225 Difference]: With dead ends: 326 [2023-02-14 10:54:20,898 INFO L226 Difference]: Without dead ends: 285 [2023-02-14 10:54:20,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-02-14 10:54:20,899 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 750 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:20,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 742 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-14 10:54:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 166. [2023-02-14 10:54:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.2039473684210527) internal successors, (183), 163 states have internal predecessors, (183), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 199 transitions. [2023-02-14 10:54:20,923 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 199 transitions. Word has length 39 [2023-02-14 10:54:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:20,923 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 199 transitions. [2023-02-14 10:54:20,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2023-02-14 10:54:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 10:54:20,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:20,924 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1] [2023-02-14 10:54:20,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 10:54:20,924 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash -294674703, now seen corresponding path program 2 times [2023-02-14 10:54:20,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:20,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914977495] [2023-02-14 10:54:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914977495] [2023-02-14 10:54:21,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914977495] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:21,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216812315] [2023-02-14 10:54:21,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:54:21,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:21,281 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 10:54:21,308 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 10:54:21,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-14 10:54:21,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:54:21,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 10:54:21,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:21,509 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 19 treesize of output 7 [2023-02-14 10:54:21,513 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 19 treesize of output 7 [2023-02-14 10:54:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-14 10:54:21,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 10:54:21,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216812315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:21,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 10:54:21,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2023-02-14 10:54:21,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569737880] [2023-02-14 10:54:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:21,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 10:54:21,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:21,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 10:54:21,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-02-14 10:54:21,517 INFO L87 Difference]: Start difference. First operand 166 states and 199 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:21,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:21,744 INFO L93 Difference]: Finished difference Result 222 states and 275 transitions. [2023-02-14 10:54:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:54:21,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-14 10:54:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:21,746 INFO L225 Difference]: With dead ends: 222 [2023-02-14 10:54:21,747 INFO L226 Difference]: Without dead ends: 219 [2023-02-14 10:54:21,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-02-14 10:54:21,747 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 98 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:21,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 419 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-14 10:54:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 156. [2023-02-14 10:54:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 153 states have internal predecessors, (173), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 189 transitions. [2023-02-14 10:54:21,777 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 189 transitions. Word has length 42 [2023-02-14 10:54:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:21,778 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 189 transitions. [2023-02-14 10:54:21,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 189 transitions. [2023-02-14 10:54:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 10:54:21,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:21,778 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:21,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-14 10:54:21,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 10:54:21,983 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1447224354, now seen corresponding path program 1 times [2023-02-14 10:54:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275968103] [2023-02-14 10:54:21,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:21,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:22,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275968103] [2023-02-14 10:54:22,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275968103] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:22,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361814466] [2023-02-14 10:54:22,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:22,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:22,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:22,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:54:22,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-14 10:54:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:22,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 10:54:22,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:22,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:22,296 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 10:54:22,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:22,300 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 10:54:22,381 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 10:54:22,383 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 10:54:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:22,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:22,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361814466] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:54:22,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:54:22,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2023-02-14 10:54:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426387393] [2023-02-14 10:54:22,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:22,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 10:54:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:22,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 10:54:22,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-14 10:54:22,468 INFO L87 Difference]: Start difference. First operand 156 states and 189 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:22,591 INFO L93 Difference]: Finished difference Result 249 states and 306 transitions. [2023-02-14 10:54:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 10:54:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-14 10:54:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:22,592 INFO L225 Difference]: With dead ends: 249 [2023-02-14 10:54:22,593 INFO L226 Difference]: Without dead ends: 188 [2023-02-14 10:54:22,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-02-14 10:54:22,593 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:22,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 479 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 10:54:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-14 10:54:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2023-02-14 10:54:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 156 states have (on average 1.1987179487179487) internal successors, (187), 167 states have internal predecessors, (187), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2023-02-14 10:54:22,618 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 42 [2023-02-14 10:54:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:22,619 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2023-02-14 10:54:22,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2023-02-14 10:54:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 10:54:22,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:22,619 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:22,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-14 10:54:22,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-14 10:54:22,829 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:22,829 INFO L85 PathProgramCache]: Analyzing trace with hash -600772010, now seen corresponding path program 2 times [2023-02-14 10:54:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:22,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196065801] [2023-02-14 10:54:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:23,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196065801] [2023-02-14 10:54:23,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196065801] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:23,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133045813] [2023-02-14 10:54:23,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 10:54:23,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:23,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:23,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:54:23,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-14 10:54:23,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 10:54:23,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 10:54:23,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-14 10:54:23,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:23,441 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 10:54:23,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:23,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 10:54:23,491 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-14 10:54:23,491 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 10:54:23,531 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-14 10:54:23,531 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 16 treesize of output 18 [2023-02-14 10:54:23,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-14 10:54:23,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:23,593 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 10:54:23,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:23,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2023-02-14 10:54:23,815 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 10:54:23,935 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 10:54:23,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 23 [2023-02-14 10:54:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:23,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:24,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_12| Int) (v_ArrVal_690 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_690))) (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_12| (store (store (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_12|) 0 |c_ULTIMATE.start_main_~node~1#1.base|) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_12|) 0)))) is different from false [2023-02-14 10:54:24,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:24,099 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2023-02-14 10:54:24,104 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:24,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:24,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 81 [2023-02-14 10:54:24,115 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 66 treesize of output 64 [2023-02-14 10:54:24,149 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 76 treesize of output 70 [2023-02-14 10:54:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-14 10:54:24,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133045813] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:54:24,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:54:24,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2023-02-14 10:54:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425294987] [2023-02-14 10:54:24,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 10:54:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 10:54:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=528, Unknown=1, NotChecked=46, Total=650 [2023-02-14 10:54:24,293 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:25,854 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2023-02-14 10:54:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 10:54:25,855 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-14 10:54:25,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:25,856 INFO L225 Difference]: With dead ends: 312 [2023-02-14 10:54:25,856 INFO L226 Difference]: Without dead ends: 309 [2023-02-14 10:54:25,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=976, Unknown=1, NotChecked=68, Total=1332 [2023-02-14 10:54:25,857 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 1314 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1318 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:25,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1318 Valid, 1249 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1096 Invalid, 0 Unknown, 292 Unchecked, 0.8s Time] [2023-02-14 10:54:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-02-14 10:54:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 181. [2023-02-14 10:54:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.1916167664670658) internal successors, (199), 178 states have internal predecessors, (199), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2023-02-14 10:54:25,894 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 44 [2023-02-14 10:54:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:25,894 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2023-02-14 10:54:25,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:25,895 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2023-02-14 10:54:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 10:54:25,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:25,895 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1] [2023-02-14 10:54:25,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 10:54:26,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:26,102 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 186164471, now seen corresponding path program 1 times [2023-02-14 10:54:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:26,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468145293] [2023-02-14 10:54:26,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:26,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468145293] [2023-02-14 10:54:26,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468145293] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:26,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276642819] [2023-02-14 10:54:26,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:26,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:26,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:26,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:54:26,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-14 10:54:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:26,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-14 10:54:26,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:26,664 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 6 treesize of output 5 [2023-02-14 10:54:26,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 10:54:26,727 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:54:26,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-02-14 10:54:26,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-02-14 10:54:26,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,787 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 10:54:26,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:26,800 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 10:54:26,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2023-02-14 10:54:26,993 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 10:54:27,212 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:54:27,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 22 [2023-02-14 10:54:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:27,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:27,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:27,538 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 71 [2023-02-14 10:54:27,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:27,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 497 treesize of output 475 [2023-02-14 10:54:27,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 757 treesize of output 719 [2023-02-14 10:54:27,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:27,791 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 194 treesize of output 178 [2023-02-14 10:54:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:27,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276642819] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 10:54:27,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 10:54:27,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2023-02-14 10:54:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542468574] [2023-02-14 10:54:27,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 10:54:27,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-14 10:54:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:27,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-14 10:54:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=832, Unknown=8, NotChecked=0, Total=930 [2023-02-14 10:54:27,883 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:29,915 INFO L93 Difference]: Finished difference Result 348 states and 424 transitions. [2023-02-14 10:54:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-14 10:54:29,916 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2023-02-14 10:54:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:29,917 INFO L225 Difference]: With dead ends: 348 [2023-02-14 10:54:29,917 INFO L226 Difference]: Without dead ends: 345 [2023-02-14 10:54:29,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=530, Invalid=2012, Unknown=8, NotChecked=0, Total=2550 [2023-02-14 10:54:29,918 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 1986 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:29,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 1245 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1163 Invalid, 1 Unknown, 0 Unchecked, 0.9s Time] [2023-02-14 10:54:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-02-14 10:54:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 188. [2023-02-14 10:54:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 174 states have (on average 1.1839080459770115) internal successors, (206), 185 states have internal predecessors, (206), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 222 transitions. [2023-02-14 10:54:29,954 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 222 transitions. Word has length 44 [2023-02-14 10:54:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:29,955 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 222 transitions. [2023-02-14 10:54:29,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 222 transitions. [2023-02-14 10:54:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 10:54:29,955 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:29,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:29,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-14 10:54:30,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:30,163 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:30,164 INFO L85 PathProgramCache]: Analyzing trace with hash -498608819, now seen corresponding path program 1 times [2023-02-14 10:54:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:30,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435164156] [2023-02-14 10:54:30,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 10:54:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:30,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435164156] [2023-02-14 10:54:30,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435164156] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 10:54:30,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 10:54:30,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 10:54:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13500521] [2023-02-14 10:54:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 10:54:30,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 10:54:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 10:54:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 10:54:30,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 10:54:30,211 INFO L87 Difference]: Start difference. First operand 188 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 10:54:30,293 INFO L93 Difference]: Finished difference Result 190 states and 223 transitions. [2023-02-14 10:54:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 10:54:30,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-02-14 10:54:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 10:54:30,295 INFO L225 Difference]: With dead ends: 190 [2023-02-14 10:54:30,295 INFO L226 Difference]: Without dead ends: 153 [2023-02-14 10:54:30,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-14 10:54:30,297 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 10:54:30,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 10:54:30,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-14 10:54:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-02-14 10:54:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 150 states have internal predecessors, (167), 11 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-14 10:54:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2023-02-14 10:54:30,335 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 45 [2023-02-14 10:54:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 10:54:30,336 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2023-02-14 10:54:30,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 10:54:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2023-02-14 10:54:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-14 10:54:30,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 10:54:30,336 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 10:54:30,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-14 10:54:30,337 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 10:54:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 10:54:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -636511633, now seen corresponding path program 1 times [2023-02-14 10:54:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 10:54:30,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26455295] [2023-02-14 10:54:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:30,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 10:54:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 10:54:31,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26455295] [2023-02-14 10:54:31,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26455295] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 10:54:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455122761] [2023-02-14 10:54:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 10:54:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 10:54:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 10:54:31,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 10:54:31,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 10:54:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 10:54:31,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 85 conjunts are in the unsatisfiable core [2023-02-14 10:54:31,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 10:54:31,611 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 10:54:31,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:31,646 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 10:54:31,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:31,651 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 10:54:31,689 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 10:54:31,689 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 11 treesize of output 11 [2023-02-14 10:54:31,723 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 16 treesize of output 18 [2023-02-14 10:54:31,726 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 16 treesize of output 18 [2023-02-14 10:54:31,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:31,765 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:31,773 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 10:54:31,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2023-02-14 10:54:31,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 10:54:31,781 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 10:54:31,788 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-02-14 10:54:31,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-02-14 10:54:32,522 INFO L321 Elim1Store]: treesize reduction 187, result has 13.0 percent of original size [2023-02-14 10:54:32,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 129 treesize of output 94 [2023-02-14 10:54:32,540 INFO L321 Elim1Store]: treesize reduction 90, result has 7.2 percent of original size [2023-02-14 10:54:32,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 68 treesize of output 43 [2023-02-14 10:54:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 10:54:32,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 10:54:35,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_935) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_938) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (not (= (select (select .cse0 v_ArrVal_938) v_ArrVal_935) 0)) (not (= (select (select .cse2 v_ArrVal_938) v_ArrVal_935) 0)) (= (select .cse1 .cse3) 0))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_938) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_935) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select (select .cse5 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (= (select .cse6 .cse3) 0) (not (= (select (select .cse5 v_ArrVal_938) v_ArrVal_935) 0)) (not (= (select (select .cse7 v_ArrVal_938) v_ArrVal_935) 0)))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_938) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_935) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (or (= (select .cse8 .cse3) 0) (not (= (select (select .cse9 v_ArrVal_938) v_ArrVal_935) 0)) (not (= (select (select .cse10 v_ArrVal_938) v_ArrVal_935) 0)) (= (select (select .cse10 (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse10 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_935) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_938) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse13 (select .cse12 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse11 v_ArrVal_938) v_ArrVal_935) 0)) (not (= (select (select .cse12 v_ArrVal_938) v_ArrVal_935) 0)) (= (select .cse13 .cse3) 0) (= (select (select .cse12 (select (select .cse11 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select .cse13 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0))))))) is different from false [2023-02-14 10:54:35,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_931))) (store .cse5 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse5 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_938) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_932))) (store .cse4 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse4 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_935) 4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (.cse1 (select .cse3 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (select .cse0 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (not (= (select (select .cse0 v_ArrVal_938) v_ArrVal_935) 0)) (= (select .cse1 .cse2) 0) (not (= (select (select .cse3 v_ArrVal_938) v_ArrVal_935) 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse6 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_931))) (store .cse10 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse10 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_938) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_932))) (store .cse9 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse9 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_935) 4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (.cse7 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (select .cse6 (select .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse8 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (not (= (select (select .cse8 v_ArrVal_938) v_ArrVal_935) 0)) (= (select .cse7 .cse2) 0) (not (= (select (select .cse6 v_ArrVal_938) v_ArrVal_935) 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse13 (let ((.cse15 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_932))) (store .cse15 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse15 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_935) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse11 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_931))) (store .cse14 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse14 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_938) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (or (= (select (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select .cse12 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (= (select .cse12 .cse2) 0) (not (= (select (select .cse13 v_ArrVal_938) v_ArrVal_935) 0)) (not (= (select (select .cse11 v_ArrVal_938) v_ArrVal_935) 0)))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_938 Int) (v_ArrVal_935 Int)) (let ((.cse16 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_932))) (store .cse20 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse20 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_935) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))))) (let ((.cse18 (select .cse16 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse17 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_931))) (store .cse19 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse19 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_938) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (or (= (select (select .cse16 (select (select .cse17 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select .cse18 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (= (select .cse18 .cse2) 0) (not (= (select (select .cse16 v_ArrVal_938) v_ArrVal_935) 0)) (not (= (select (select .cse17 v_ArrVal_938) v_ArrVal_935) 0)))))))) is different from false [2023-02-14 10:54:35,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:35,820 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 248 treesize of output 162 [2023-02-14 10:54:35,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:35,831 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 144 treesize of output 110 [2023-02-14 10:54:35,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:35,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1040 treesize of output 1036 [2023-02-14 10:54:36,107 INFO L321 Elim1Store]: treesize reduction 58, result has 79.9 percent of original size [2023-02-14 10:54:36,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 27265 treesize of output 24979 [2023-02-14 10:54:36,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:36,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 90855 treesize of output 82831 [2023-02-14 10:54:41,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 10:54:41,293 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 99836 treesize of output 97334 [2023-02-14 10:54:43,824 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 6 treesize of output 4 [2023-02-14 10:54:43,930 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 6 treesize of output 4 [2023-02-14 10:54:47,275 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 6 treesize of output 4 [2023-02-14 10:54:47,343 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 6 treesize of output 4