./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 e8d55036 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-?-e8d5503-m [2023-02-15 19:27:33,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:27:33,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:27:33,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:27:33,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:27:33,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:27:33,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:27:33,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:27:33,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:27:33,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:27:33,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:27:33,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:27:33,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:27:33,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:27:33,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:27:33,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:27:33,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:27:33,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:27:33,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:27:33,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:27:33,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:27:33,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:27:33,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:27:33,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:27:33,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:27:33,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:27:33,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:27:33,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:27:33,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:27:33,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:27:33,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:27:33,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:27:33,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:27:33,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:27:33,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:27:33,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:27:33,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:27:33,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:27:33,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:27:33,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:27:33,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:27:33,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:27:33,612 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:27:33,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:27:33,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:27:33,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:27:33,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:27:33,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:27:33,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:27:33,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:27:33,619 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:27:33,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:27:33,620 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:27:33,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:27:33,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:27:33,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:27:33,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:27:33,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:27:33,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:27:33,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:27:33,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:27:33,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:27:33,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:27:33,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:27:33,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:27:33,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:27:33,623 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:27:33,623 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:27:33,624 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:27:33,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:27:33,624 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:27:33,624 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-15 19:27:33,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:27:33,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:27:33,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:27:33,823 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:27:33,823 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:27:33,824 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-15 19:27:34,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:27:34,979 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:27:34,984 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-2.i [2023-02-15 19:27:34,994 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d089cc7d8/b064cd53220c4b12a9e4083e834d304d/FLAG1fa28b69c [2023-02-15 19:27:35,006 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d089cc7d8/b064cd53220c4b12a9e4083e834d304d [2023-02-15 19:27:35,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:27:35,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:27:35,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:27:35,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:27:35,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:27:35,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eadc1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35, skipping insertion in model container [2023-02-15 19:27:35,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:27:35,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:27:35,267 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-15 19:27:35,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:27:35,313 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:27:35,329 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-15 19:27:35,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:27:35,354 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:27:35,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35 WrapperNode [2023-02-15 19:27:35,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:27:35,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:27:35,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:27:35,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:27:35,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,402 INFO L138 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2023-02-15 19:27:35,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:27:35,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:27:35,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:27:35,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:27:35,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:27:35,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:27:35,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:27:35,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:27:35,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (1/1) ... [2023-02-15 19:27:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:27:35,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:35,464 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-15 19:27:35,479 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-15 19:27:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:27:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2023-02-15 19:27:35,489 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2023-02-15 19:27:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 19:27:35,489 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 19:27:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:27:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:27:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:27:35,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:27:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:27:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:27:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:27:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:27:35,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:27:35,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:27:35,572 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:27:35,574 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:27:35,860 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:27:35,865 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:27:35,866 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2023-02-15 19:27:35,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:27:35 BoogieIcfgContainer [2023-02-15 19:27:35,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:27:35,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:27:35,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:27:35,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:27:35,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:27:35" (1/3) ... [2023-02-15 19:27:35,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559f9714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:27:35, skipping insertion in model container [2023-02-15 19:27:35,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:27:35" (2/3) ... [2023-02-15 19:27:35,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559f9714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:27:35, skipping insertion in model container [2023-02-15 19:27:35,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:27:35" (3/3) ... [2023-02-15 19:27:35,877 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2023-02-15 19:27:35,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:27:35,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:27:35,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:27:35,936 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;@5cbfa9e0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:27:35,936 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:27:35,939 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-15 19:27:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 19:27:35,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:35,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:35,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:35,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2023-02-15 19:27:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:35,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658414920] [2023-02-15 19:27:35,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:35,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:36,056 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-15 19:27:36,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658414920] [2023-02-15 19:27:36,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658414920] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:36,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:36,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 19:27:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433270363] [2023-02-15 19:27:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:36,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 19:27:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:36,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 19:27:36,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 19:27:36,084 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-15 19:27:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:36,107 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2023-02-15 19:27:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 19:27:36,109 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-15 19:27:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:36,114 INFO L225 Difference]: With dead ends: 188 [2023-02-15 19:27:36,115 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 19:27:36,117 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-15 19:27:36,119 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-15 19:27:36,120 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-15 19:27:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 19:27:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 19:27:36,158 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-15 19:27:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2023-02-15 19:27:36,160 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2023-02-15 19:27:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:36,160 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2023-02-15 19:27:36,160 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-15 19:27:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2023-02-15 19:27:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 19:27:36,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:36,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:36,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:27:36,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2023-02-15 19:27:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:36,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678203262] [2023-02-15 19:27:36,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:36,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:36,209 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-15 19:27:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:36,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678203262] [2023-02-15 19:27:36,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678203262] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:36,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:36,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:27:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697638375] [2023-02-15 19:27:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:36,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:27:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:27:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:27:36,212 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-15 19:27:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:36,245 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2023-02-15 19:27:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:27:36,246 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-15 19:27:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:36,247 INFO L225 Difference]: With dead ends: 172 [2023-02-15 19:27:36,247 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 19:27:36,247 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-15 19:27:36,248 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-15 19:27:36,248 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-15 19:27:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 19:27:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-02-15 19:27:36,254 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-15 19:27:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2023-02-15 19:27:36,255 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2023-02-15 19:27:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:36,256 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2023-02-15 19:27:36,256 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-15 19:27:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2023-02-15 19:27:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 19:27:36,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:36,257 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 19:27:36,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:27:36,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2023-02-15 19:27:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:36,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824765726] [2023-02-15 19:27:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:36,432 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-15 19:27:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824765726] [2023-02-15 19:27:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824765726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:36,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:36,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:27:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735366349] [2023-02-15 19:27:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:36,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:27:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:36,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:27:36,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:27:36,436 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-15 19:27:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:36,583 INFO L93 Difference]: Finished difference Result 237 states and 310 transitions. [2023-02-15 19:27:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:27:36,583 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-15 19:27:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:36,588 INFO L225 Difference]: With dead ends: 237 [2023-02-15 19:27:36,588 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 19:27:36,590 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-15 19:27:36,591 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 519 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:36,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 280 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:27:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 19:27:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 92. [2023-02-15 19:27:36,612 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-15 19:27:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2023-02-15 19:27:36,614 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2023-02-15 19:27:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:36,615 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2023-02-15 19:27:36,615 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-15 19:27:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2023-02-15 19:27:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 19:27:36,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:36,616 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-15 19:27:36,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:27:36,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2023-02-15 19:27:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:36,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116375127] [2023-02-15 19:27:36,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:36,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:36,778 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-15 19:27:36,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:36,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116375127] [2023-02-15 19:27:36,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116375127] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:36,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:36,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:27:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419811401] [2023-02-15 19:27:36,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:27:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:36,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:27:36,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:27:36,782 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-15 19:27:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:36,879 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2023-02-15 19:27:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:27:36,879 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-15 19:27:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:36,879 INFO L225 Difference]: With dead ends: 94 [2023-02-15 19:27:36,880 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 19:27:36,880 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-15 19:27:36,888 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-15 19:27:36,889 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-15 19:27:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 19:27:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 19:27:36,900 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-15 19:27:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2023-02-15 19:27:36,901 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2023-02-15 19:27:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:36,901 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2023-02-15 19:27:36,901 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-15 19:27:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2023-02-15 19:27:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 19:27:36,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:36,902 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-15 19:27:36,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 19:27:36,902 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:36,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:36,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2023-02-15 19:27:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:36,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380425551] [2023-02-15 19:27:36,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:36,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:37,031 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-15 19:27:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:37,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380425551] [2023-02-15 19:27:37,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380425551] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:37,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:37,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:27:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920796053] [2023-02-15 19:27:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:37,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:27:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:27:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:27:37,034 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-15 19:27:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:37,140 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2023-02-15 19:27:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:27:37,141 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-15 19:27:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:37,144 INFO L225 Difference]: With dead ends: 118 [2023-02-15 19:27:37,144 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 19:27:37,145 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-15 19:27:37,145 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-15 19:27:37,146 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-15 19:27:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 19:27:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2023-02-15 19:27:37,166 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-15 19:27:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2023-02-15 19:27:37,172 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2023-02-15 19:27:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:37,173 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2023-02-15 19:27:37,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-15 19:27:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2023-02-15 19:27:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:27:37,174 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:37,174 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-15 19:27:37,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 19:27:37,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:37,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2023-02-15 19:27:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:37,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799018441] [2023-02-15 19:27:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:37,321 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-15 19:27:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799018441] [2023-02-15 19:27:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799018441] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:37,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:27:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378253431] [2023-02-15 19:27:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:37,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:27:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:37,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:27:37,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:27:37,326 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-15 19:27:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:37,477 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2023-02-15 19:27:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:27:37,478 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-15 19:27:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:37,479 INFO L225 Difference]: With dead ends: 195 [2023-02-15 19:27:37,479 INFO L226 Difference]: Without dead ends: 192 [2023-02-15 19:27:37,480 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-15 19:27:37,481 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-15 19:27:37,481 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-15 19:27:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-02-15 19:27:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2023-02-15 19:27:37,498 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-15 19:27:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2023-02-15 19:27:37,499 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2023-02-15 19:27:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:37,499 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2023-02-15 19:27:37,499 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-15 19:27:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2023-02-15 19:27:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 19:27:37,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:37,500 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-15 19:27:37,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 19:27:37,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2023-02-15 19:27:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:37,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369511285] [2023-02-15 19:27:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:37,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:37,598 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-15 19:27:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:37,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369511285] [2023-02-15 19:27:37,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369511285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:37,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:37,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 19:27:37,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704133285] [2023-02-15 19:27:37,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:37,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:27:37,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:37,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:27:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:27:37,600 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-15 19:27:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:37,755 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2023-02-15 19:27:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:27:37,755 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-15 19:27:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:37,756 INFO L225 Difference]: With dead ends: 194 [2023-02-15 19:27:37,756 INFO L226 Difference]: Without dead ends: 191 [2023-02-15 19:27:37,756 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-15 19:27:37,757 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-15 19:27:37,757 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-15 19:27:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-15 19:27:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2023-02-15 19:27:37,766 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-15 19:27:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2023-02-15 19:27:37,767 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2023-02-15 19:27:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:37,767 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2023-02-15 19:27:37,767 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-15 19:27:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2023-02-15 19:27:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:27:37,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:37,767 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-15 19:27:37,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 19:27:37,768 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2023-02-15 19:27:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:37,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572145477] [2023-02-15 19:27:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:37,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:38,060 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-15 19:27:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:38,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572145477] [2023-02-15 19:27:38,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572145477] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:38,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:38,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:27:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016218971] [2023-02-15 19:27:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:38,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:27:38,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:27:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:27:38,064 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-15 19:27:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:38,400 INFO L93 Difference]: Finished difference Result 264 states and 335 transitions. [2023-02-15 19:27:38,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:27:38,401 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-15 19:27:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:38,402 INFO L225 Difference]: With dead ends: 264 [2023-02-15 19:27:38,402 INFO L226 Difference]: Without dead ends: 261 [2023-02-15 19:27:38,402 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-15 19:27:38,403 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-15 19:27:38,404 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-15 19:27:38,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-02-15 19:27:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 105. [2023-02-15 19:27:38,420 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-15 19:27:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2023-02-15 19:27:38,420 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 27 [2023-02-15 19:27:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:38,422 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2023-02-15 19:27:38,422 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-15 19:27:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2023-02-15 19:27:38,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 19:27:38,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:38,426 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-15 19:27:38,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 19:27:38,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:38,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2023-02-15 19:27:38,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:38,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150609667] [2023-02-15 19:27:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:38,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:38,654 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-15 19:27:38,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:38,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150609667] [2023-02-15 19:27:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150609667] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:38,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 19:27:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150924057] [2023-02-15 19:27:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:38,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:27:38,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:27:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:27:38,656 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-15 19:27:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:38,965 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2023-02-15 19:27:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 19:27:38,965 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-15 19:27:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:38,966 INFO L225 Difference]: With dead ends: 263 [2023-02-15 19:27:38,967 INFO L226 Difference]: Without dead ends: 260 [2023-02-15 19:27:38,967 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-15 19:27:38,967 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-15 19:27:38,968 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-15 19:27:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-15 19:27:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 108. [2023-02-15 19:27:38,981 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-15 19:27:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2023-02-15 19:27:38,982 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 27 [2023-02-15 19:27:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:38,982 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2023-02-15 19:27:38,982 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-15 19:27:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2023-02-15 19:27:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 19:27:38,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:38,983 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-15 19:27:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 19:27:38,983 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash -399551200, now seen corresponding path program 1 times [2023-02-15 19:27:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:38,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435478840] [2023-02-15 19:27:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:39,038 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-15 19:27:39,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:39,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435478840] [2023-02-15 19:27:39,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435478840] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:39,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373178411] [2023-02-15 19:27:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:39,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:39,042 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-15 19:27:39,071 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-15 19:27:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:39,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 19:27:39,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:39,271 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-15 19:27:39,275 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-15 19:27:39,292 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-15 19:27:39,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:39,383 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-15 19:27:39,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373178411] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:39,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:39,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-02-15 19:27:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962417520] [2023-02-15 19:27:39,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:39,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 19:27:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:39,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 19:27:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:27:39,387 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-15 19:27:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:39,520 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2023-02-15 19:27:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:27:39,521 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-15 19:27:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:39,521 INFO L225 Difference]: With dead ends: 110 [2023-02-15 19:27:39,521 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 19:27:39,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:27:39,522 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 74 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:39,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 280 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:27:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 19:27:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 19:27:39,534 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-15 19:27:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2023-02-15 19:27:39,535 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 32 [2023-02-15 19:27:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:39,535 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2023-02-15 19:27:39,535 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-15 19:27:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2023-02-15 19:27:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 19:27:39,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:39,536 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-15 19:27:39,543 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-15 19:27:39,740 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-15 19:27:39,741 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2096511860, now seen corresponding path program 1 times [2023-02-15 19:27:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:39,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685630177] [2023-02-15 19:27:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:39,778 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-15 19:27:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:39,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685630177] [2023-02-15 19:27:39,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685630177] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:39,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:39,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:27:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552269579] [2023-02-15 19:27:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:39,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:27:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:27:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:27:39,781 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-15 19:27:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:39,829 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2023-02-15 19:27:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:27:39,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-15 19:27:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:39,830 INFO L225 Difference]: With dead ends: 148 [2023-02-15 19:27:39,830 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 19:27:39,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:27:39,831 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 198 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:39,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 266 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:27:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 19:27:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 110. [2023-02-15 19:27:39,845 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-15 19:27:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2023-02-15 19:27:39,846 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 33 [2023-02-15 19:27:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:39,846 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2023-02-15 19:27:39,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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-15 19:27:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2023-02-15 19:27:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:27:39,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:39,847 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-15 19:27:39,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 19:27:39,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:39,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -236025208, now seen corresponding path program 1 times [2023-02-15 19:27:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:39,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744783165] [2023-02-15 19:27:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:39,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:40,130 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-15 19:27:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:40,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744783165] [2023-02-15 19:27:40,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744783165] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:40,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275918763] [2023-02-15 19:27:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:40,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:40,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:40,132 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-15 19:27:40,134 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-15 19:27:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:40,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 19:27:40,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:40,250 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-15 19:27:40,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:40,255 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-15 19:27:40,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-15 19:27:40,386 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-15 19:27:40,388 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-15 19:27:40,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:40,483 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-15 19:27:40,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275918763] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:40,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:40,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2023-02-15 19:27:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917501350] [2023-02-15 19:27:40,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:40,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 19:27:40,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 19:27:40,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:27:40,485 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-15 19:27:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:40,666 INFO L93 Difference]: Finished difference Result 210 states and 249 transitions. [2023-02-15 19:27:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 19:27:40,666 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-15 19:27:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:40,668 INFO L225 Difference]: With dead ends: 210 [2023-02-15 19:27:40,668 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 19:27:40,668 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-15 19:27:40,669 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 134 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:40,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 334 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:27:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 19:27:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2023-02-15 19:27:40,694 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-15 19:27:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2023-02-15 19:27:40,694 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 36 [2023-02-15 19:27:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:40,695 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2023-02-15 19:27:40,695 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-15 19:27:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2023-02-15 19:27:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:27:40,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:40,696 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-15 19:27:40,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 19:27:40,901 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-15 19:27:40,901 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash -73182163, now seen corresponding path program 1 times [2023-02-15 19:27:40,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:40,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017114139] [2023-02-15 19:27:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:41,076 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-15 19:27:41,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:41,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017114139] [2023-02-15 19:27:41,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017114139] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:41,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316046795] [2023-02-15 19:27:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:41,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:41,078 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-15 19:27:41,080 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-15 19:27:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:41,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 19:27:41,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:41,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:41,181 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-15 19:27:41,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:41,185 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-15 19:27:41,217 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-15 19:27:41,220 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-15 19:27:41,228 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-15 19:27:41,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:41,268 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-15 19:27:41,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316046795] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:41,269 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:41,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2023-02-15 19:27:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142952197] [2023-02-15 19:27:41,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:41,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 19:27:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:41,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 19:27:41,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-02-15 19:27:41,270 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-15 19:27:41,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:41,511 INFO L93 Difference]: Finished difference Result 293 states and 359 transitions. [2023-02-15 19:27:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:27:41,512 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-15 19:27:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:41,513 INFO L225 Difference]: With dead ends: 293 [2023-02-15 19:27:41,513 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 19:27:41,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:27:41,515 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 290 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:41,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 423 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:27:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 19:27:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 140. [2023-02-15 19:27:41,534 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-15 19:27:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2023-02-15 19:27:41,534 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 38 [2023-02-15 19:27:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:41,535 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2023-02-15 19:27:41,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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-15 19:27:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2023-02-15 19:27:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:27:41,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:41,536 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-15 19:27:41,543 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-15 19:27:41,743 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-15 19:27:41,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:41,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash 490774160, now seen corresponding path program 1 times [2023-02-15 19:27:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:41,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454609779] [2023-02-15 19:27:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:41,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:41,777 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-15 19:27:41,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454609779] [2023-02-15 19:27:41,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454609779] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:41,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:41,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:27:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916769943] [2023-02-15 19:27:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:41,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:27:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:27:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:27:41,778 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-15 19:27:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:41,850 INFO L93 Difference]: Finished difference Result 248 states and 308 transitions. [2023-02-15 19:27:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 19:27:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-15 19:27:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:41,851 INFO L225 Difference]: With dead ends: 248 [2023-02-15 19:27:41,851 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 19:27:41,852 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-15 19:27:41,852 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 260 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:41,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 19:27:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 19:27:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 141. [2023-02-15 19:27:41,876 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-15 19:27:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2023-02-15 19:27:41,876 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 38 [2023-02-15 19:27:41,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:41,877 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2023-02-15 19:27:41,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 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-15 19:27:41,877 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2023-02-15 19:27:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 19:27:41,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:41,877 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-15 19:27:41,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 19:27:41,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash -557560351, now seen corresponding path program 1 times [2023-02-15 19:27:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:41,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191790000] [2023-02-15 19:27:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:41,998 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-15 19:27:41,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:41,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191790000] [2023-02-15 19:27:41,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191790000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:41,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:41,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 19:27:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492347668] [2023-02-15 19:27:41,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:41,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:27:41,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:27:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:27:42,000 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-15 19:27:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:42,271 INFO L93 Difference]: Finished difference Result 186 states and 216 transitions. [2023-02-15 19:27:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 19:27:42,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-15 19:27:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:42,272 INFO L225 Difference]: With dead ends: 186 [2023-02-15 19:27:42,272 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 19:27:42,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2023-02-15 19:27:42,273 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 301 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:42,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 523 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 19:27:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 19:27:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2023-02-15 19:27:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 141 states have (on average 1.1702127659574468) internal successors, (165), 150 states have internal predecessors, (165), 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-15 19:27:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2023-02-15 19:27:42,297 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 39 [2023-02-15 19:27:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:42,298 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2023-02-15 19:27:42,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 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-15 19:27:42,298 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2023-02-15 19:27:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 19:27:42,298 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:42,298 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-15 19:27:42,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 19:27:42,298 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1187191262, now seen corresponding path program 1 times [2023-02-15 19:27:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:42,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796873000] [2023-02-15 19:27:42,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:42,365 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-15 19:27:42,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:42,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796873000] [2023-02-15 19:27:42,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796873000] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:42,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:42,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 19:27:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021678195] [2023-02-15 19:27:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:42,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 19:27:42,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 19:27:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:27:42,367 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-15 19:27:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:42,534 INFO L93 Difference]: Finished difference Result 295 states and 371 transitions. [2023-02-15 19:27:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 19:27:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-15 19:27:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:42,535 INFO L225 Difference]: With dead ends: 295 [2023-02-15 19:27:42,536 INFO L226 Difference]: Without dead ends: 254 [2023-02-15 19:27:42,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-02-15 19:27:42,537 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 400 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:42,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 643 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:27:42,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-15 19:27:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 168. [2023-02-15 19:27:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 154 states have (on average 1.2012987012987013) internal successors, (185), 165 states have internal predecessors, (185), 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-15 19:27:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2023-02-15 19:27:42,561 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 39 [2023-02-15 19:27:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:42,573 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2023-02-15 19:27:42,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 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-15 19:27:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2023-02-15 19:27:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:27:42,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:42,573 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-15 19:27:42,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 19:27:42,574 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -294674703, now seen corresponding path program 2 times [2023-02-15 19:27:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:42,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073069720] [2023-02-15 19:27:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:42,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:42,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073069720] [2023-02-15 19:27:42,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073069720] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:42,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113656476] [2023-02-15 19:27:42,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:27:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:42,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:42,798 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-15 19:27:42,799 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-15 19:27:42,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 19:27:42,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:27:42,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 19:27:42,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:42,992 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-15 19:27:42,996 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-15 19:27:43,009 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-15 19:27:43,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:27:43,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113656476] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:43,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:27:43,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2023-02-15 19:27:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548451834] [2023-02-15 19:27:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:43,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 19:27:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:43,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 19:27:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-02-15 19:27:43,012 INFO L87 Difference]: Start difference. First operand 168 states and 201 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-15 19:27:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:43,242 INFO L93 Difference]: Finished difference Result 212 states and 263 transitions. [2023-02-15 19:27:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:27:43,243 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-15 19:27:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:43,244 INFO L225 Difference]: With dead ends: 212 [2023-02-15 19:27:43,244 INFO L226 Difference]: Without dead ends: 209 [2023-02-15 19:27:43,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-02-15 19:27:43,244 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-15 19:27:43,244 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-15 19:27:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-15 19:27:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 149. [2023-02-15 19:27:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.2148148148148148) internal successors, (164), 146 states have internal predecessors, (164), 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-15 19:27:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2023-02-15 19:27:43,266 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 42 [2023-02-15 19:27:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:43,266 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2023-02-15 19:27:43,266 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-15 19:27:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2023-02-15 19:27:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 19:27:43,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:43,266 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-15 19:27:43,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 19:27:43,470 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-15 19:27:43,471 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1447224354, now seen corresponding path program 1 times [2023-02-15 19:27:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588572419] [2023-02-15 19:27:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:43,657 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-15 19:27:43,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:43,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588572419] [2023-02-15 19:27:43,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588572419] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:43,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65667947] [2023-02-15 19:27:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:43,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:43,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:43,659 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-15 19:27:43,661 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-15 19:27:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:43,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 19:27:43,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:43,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:43,780 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-15 19:27:43,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:43,784 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-15 19:27:43,854 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-15 19:27:43,856 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-15 19:27:43,863 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-15 19:27:43,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:43,934 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-15 19:27:43,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65667947] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:43,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:43,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 10 [2023-02-15 19:27:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101596439] [2023-02-15 19:27:43,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 19:27:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 19:27:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-02-15 19:27:43,936 INFO L87 Difference]: Start difference. First operand 149 states and 180 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-15 19:27:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:44,062 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2023-02-15 19:27:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:27:44,062 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-15 19:27:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:44,063 INFO L225 Difference]: With dead ends: 242 [2023-02-15 19:27:44,063 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 19:27:44,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-02-15 19:27:44,064 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:44,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 478 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 19:27:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 19:27:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2023-02-15 19:27:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 149 states have (on average 1.1946308724832215) internal successors, (178), 160 states have internal predecessors, (178), 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-15 19:27:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 194 transitions. [2023-02-15 19:27:44,099 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 194 transitions. Word has length 42 [2023-02-15 19:27:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:44,099 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 194 transitions. [2023-02-15 19:27:44,100 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-15 19:27:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 194 transitions. [2023-02-15 19:27:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:27:44,100 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:44,100 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-15 19:27:44,114 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-15 19:27:44,305 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-15 19:27:44,305 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:44,306 INFO L85 PathProgramCache]: Analyzing trace with hash -600772010, now seen corresponding path program 2 times [2023-02-15 19:27:44,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:44,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729692930] [2023-02-15 19:27:44,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:44,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:44,830 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-15 19:27:44,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729692930] [2023-02-15 19:27:44,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729692930] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190338289] [2023-02-15 19:27:44,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:27:44,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:44,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:44,832 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-15 19:27:44,835 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-15 19:27:44,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:27:44,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:27:44,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 19:27:44,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:44,996 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-15 19:27:45,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:45,024 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-15 19:27:45,039 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:45,039 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-15 19:27:45,071 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-15 19:27:45,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:45,117 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-15 19:27:45,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:45,129 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:27:45,129 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 1 case distinctions, treesize of input 25 treesize of output 32 [2023-02-15 19:27:45,296 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-15 19:27:45,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:45,384 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 44 treesize of output 27 [2023-02-15 19:27:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:45,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:45,520 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int)) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_689))) (store .cse0 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse0 |ULTIMATE.start_main_~item~0#1.base|) 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|)))) is different from false [2023-02-15 19:27:45,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:45,596 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-15 19:27:45,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:45,611 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 319 treesize of output 309 [2023-02-15 19:27:45,619 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 438 treesize of output 422 [2023-02-15 19:27:45,728 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 101 treesize of output 99 [2023-02-15 19:27:45,739 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 123 treesize of output 115 [2023-02-15 19:27:45,834 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-15 19:27:45,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190338289] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:45,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:45,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 28 [2023-02-15 19:27:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677444910] [2023-02-15 19:27:45,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:45,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 19:27:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:45,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 19:27:45,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=626, Unknown=1, NotChecked=50, Total=756 [2023-02-15 19:27:45,836 INFO L87 Difference]: Start difference. First operand 163 states and 194 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 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-15 19:27:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:47,342 INFO L93 Difference]: Finished difference Result 314 states and 381 transitions. [2023-02-15 19:27:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 19:27:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 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-15 19:27:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:47,343 INFO L225 Difference]: With dead ends: 314 [2023-02-15 19:27:47,343 INFO L226 Difference]: Without dead ends: 311 [2023-02-15 19:27:47,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=304, Invalid=1181, Unknown=1, NotChecked=74, Total=1560 [2023-02-15 19:27:47,344 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1828 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:47,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 1214 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1026 Invalid, 6 Unknown, 193 Unchecked, 0.8s Time] [2023-02-15 19:27:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-15 19:27:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 174. [2023-02-15 19:27:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.1875) internal successors, (190), 171 states have internal predecessors, (190), 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-15 19:27:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2023-02-15 19:27:47,391 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 44 [2023-02-15 19:27:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:47,391 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2023-02-15 19:27:47,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 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-15 19:27:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2023-02-15 19:27:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 19:27:47,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:47,392 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-15 19:27:47,399 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-15 19:27:47,596 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-15 19:27:47,599 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 186164471, now seen corresponding path program 1 times [2023-02-15 19:27:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010806874] [2023-02-15 19:27:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:47,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:48,112 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-15 19:27:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010806874] [2023-02-15 19:27:48,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010806874] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111632148] [2023-02-15 19:27:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:48,114 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-15 19:27:48,116 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-15 19:27:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:48,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 19:27:48,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:48,244 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-15 19:27:48,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:48,269 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-15 19:27:48,294 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:48,295 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-15 19:27:48,328 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-15 19:27:48,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:48,371 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:27:48,371 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-15 19:27:48,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:48,386 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-15 19:27:48,597 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-15 19:27:48,780 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:48,780 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-15 19:27:48,783 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-15 19:27:48,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:49,003 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 Int)) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_796))) (store .cse1 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse1 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_798) 4 |c_ULTIMATE.start_main_~data~0#1.base|))) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= 0 (select .cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)))) (not (= 0 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|)))))) is different from false [2023-02-15 19:27:49,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:49,084 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-15 19:27:49,093 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:49,093 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 489 treesize of output 475 [2023-02-15 19:27:49,104 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 1285 treesize of output 1219 [2023-02-15 19:27:49,305 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 186 treesize of output 180 [2023-02-15 19:27:49,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:49,321 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 188 treesize of output 172 [2023-02-15 19:27:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 19:27:49,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111632148] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:27:49,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:27:49,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 33 [2023-02-15 19:27:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140842038] [2023-02-15 19:27:49,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:27:49,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 19:27:49,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 19:27:49,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=904, Unknown=1, NotChecked=60, Total=1056 [2023-02-15 19:27:49,405 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand has 33 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 33 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-15 19:27:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:51,667 INFO L93 Difference]: Finished difference Result 350 states and 428 transitions. [2023-02-15 19:27:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 19:27:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 33 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-15 19:27:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:51,668 INFO L225 Difference]: With dead ends: 350 [2023-02-15 19:27:51,668 INFO L226 Difference]: Without dead ends: 347 [2023-02-15 19:27:51,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=535, Invalid=2120, Unknown=1, NotChecked=100, Total=2756 [2023-02-15 19:27:51,669 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 2134 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2136 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 19:27:51,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2136 Valid, 1383 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1376 Invalid, 1 Unknown, 249 Unchecked, 1.1s Time] [2023-02-15 19:27:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-02-15 19:27:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 181. [2023-02-15 19:27:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.1796407185628743) internal successors, (197), 178 states have internal predecessors, (197), 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-15 19:27:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2023-02-15 19:27:51,699 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 44 [2023-02-15 19:27:51,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:51,699 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2023-02-15 19:27:51,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.3636363636363638) internal successors, (111), 33 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-15 19:27:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2023-02-15 19:27:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 19:27:51,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:51,699 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-15 19:27:51,706 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-15 19:27:51,905 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-15 19:27:51,906 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash -498608819, now seen corresponding path program 1 times [2023-02-15 19:27:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:51,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795081894] [2023-02-15 19:27:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:51,947 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-15 19:27:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:51,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795081894] [2023-02-15 19:27:51,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795081894] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:27:51,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:27:51,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 19:27:51,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200183368] [2023-02-15 19:27:51,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:27:51,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:27:51,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:27:51,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:27:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 19:27:51,948 INFO L87 Difference]: Start difference. First operand 181 states and 213 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-15 19:27:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:27:52,020 INFO L93 Difference]: Finished difference Result 183 states and 214 transitions. [2023-02-15 19:27:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:27:52,021 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-15 19:27:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:27:52,022 INFO L225 Difference]: With dead ends: 183 [2023-02-15 19:27:52,022 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 19:27:52,022 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-15 19:27:52,022 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-15 19:27:52,022 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-15 19:27:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 19:27:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-02-15 19:27:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 133 states have (on average 1.1954887218045114) internal successors, (159), 143 states have internal predecessors, (159), 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-15 19:27:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2023-02-15 19:27:52,051 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 45 [2023-02-15 19:27:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:27:52,052 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2023-02-15 19:27:52,052 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-15 19:27:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2023-02-15 19:27:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 19:27:52,052 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:27:52,052 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-15 19:27:52,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 19:27:52,053 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:27:52,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:27:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash -636511633, now seen corresponding path program 1 times [2023-02-15 19:27:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:27:52,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924521123] [2023-02-15 19:27:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:27:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:52,902 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-15 19:27:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:27:52,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924521123] [2023-02-15 19:27:52,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924521123] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:27:52,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552744655] [2023-02-15 19:27:52,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:27:52,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:27:52,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:27:52,904 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-15 19:27:52,905 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-15 19:27:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:27:53,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 19:27:53,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:27:53,041 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-15 19:27:53,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:53,074 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-15 19:27:53,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:53,081 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-15 19:27:53,114 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:27:53,115 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-15 19:27:53,148 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-15 19:27:53,152 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-15 19:27:53,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:53,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:53,197 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 19:27:53,198 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-15 19:27:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:27:53,202 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:53,207 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-02-15 19:27:53,207 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-15 19:27:53,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 19:27:53,843 INFO L321 Elim1Store]: treesize reduction 129, result has 21.8 percent of original size [2023-02-15 19:27:53,843 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 14 case distinctions, treesize of input 118 treesize of output 95 [2023-02-15 19:27:53,860 INFO L321 Elim1Store]: treesize reduction 90, result has 7.2 percent of original size [2023-02-15 19:27:53,860 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 60 treesize of output 43 [2023-02-15 19:27:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 19:27:53,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:27:56,348 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_937 Int) (v_ArrVal_934 Int)) (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_934) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse1 (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_937) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse0 v_ArrVal_934) v_ArrVal_937) 0)) (= (select (select .cse1 (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (not (= 0 (select (select .cse1 v_ArrVal_934) v_ArrVal_937))) (= (select .cse2 .cse3) 0))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 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_934) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (let ((.cse6 (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_937) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|))) (.cse7 (select .cse5 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse5 v_ArrVal_934) v_ArrVal_937) 0)) (not (= 0 (select (select .cse6 v_ArrVal_934) v_ArrVal_937))) (= (select (select .cse5 (select .cse7 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (= (select .cse7 .cse3) 0))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 Int)) (let ((.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_937) .cse4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (let ((.cse8 (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_934) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse9 (select .cse10 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse8 v_ArrVal_934) v_ArrVal_937) 0)) (= (select .cse9 .cse3) 0) (not (= 0 (select (select .cse10 v_ArrVal_934) v_ArrVal_937))) (= (select (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select .cse9 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0))))) (forall ((|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 Int)) (let ((.cse13 (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_937) .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_934) .cse4 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= (select (select .cse11 v_ArrVal_934) v_ArrVal_937) 0)) (= (select .cse12 .cse3) 0) (= (select (select .cse13 (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) (not (= 0 (select (select .cse13 v_ArrVal_934) v_ArrVal_937))))))))) is different from false [2023-02-15 19:27:56,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 Int)) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_930))) (store .cse5 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse5 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_934) 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_931))) (store .cse4 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse4 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_937) 4 |c_ULTIMATE.start_main_~data~0#1.offset|)))) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= 0 (select (select .cse0 v_ArrVal_934) v_ArrVal_937))) (not (= (select (select .cse1 v_ArrVal_934) v_ArrVal_937) 0)) (= (select (select .cse1 (select .cse2 |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) (= (select .cse2 .cse3) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 Int)) (let ((.cse6 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |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_937) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))))) (let ((.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_930))) (store .cse9 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse9 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_934) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (.cse8 (select .cse6 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= 0 (select (select .cse6 v_ArrVal_934) v_ArrVal_937))) (not (= (select (select .cse7 v_ArrVal_934) v_ArrVal_937) 0)) (= (select (select .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) (select .cse8 |c_ULTIMATE.start_main_~data~0#1.offset|)) 0) (= (select .cse8 .cse3) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 Int)) (let ((.cse12 (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_930))) (store .cse15 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse15 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_934) 4 |c_ULTIMATE.start_main_~data~0#1.base|))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse11 (let ((.cse14 (store |c_#memory_$Pointer$.offset| |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_937) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))))) (or (not (= 0 (select (select .cse11 v_ArrVal_934) v_ArrVal_937))) (not (= (select (select .cse12 v_ArrVal_934) v_ArrVal_937) 0)) (= (select .cse13 .cse3) 0) (= (select (select .cse11 (select .cse13 |c_ULTIMATE.start_main_~data~0#1.offset|)) (select (select .cse11 |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset|)) 0))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_930 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.base| Int) (v_ArrVal_937 Int) (v_ArrVal_934 Int)) (let ((.cse16 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_931))) (store .cse20 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse20 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_937) 4 |c_ULTIMATE.start_main_~data~0#1.offset|))))) (let ((.cse17 (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~node~1#1.base| v_ArrVal_930))) (store .cse19 |ULTIMATE.start_main_~item~0#1.base| (store (store (select .cse19 |ULTIMATE.start_main_~item~0#1.base|) 0 v_ArrVal_934) 4 |c_ULTIMATE.start_main_~data~0#1.base|)))) (.cse18 (select .cse16 |c_ULTIMATE.start_main_~data~0#1.base|))) (or (not (= 0 (select (select .cse16 v_ArrVal_934) v_ArrVal_937))) (not (= (select (select .cse17 v_ArrVal_934) v_ArrVal_937) 0)) (= (select .cse18 .cse3) 0) (= (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))))))) is different from false [2023-02-15 19:27:57,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:57,079 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-15 19:27:57,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:57,089 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-15 19:27:57,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:57,114 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 880 treesize of output 884 [2023-02-15 19:27:57,347 INFO L321 Elim1Store]: treesize reduction 84, result has 70.9 percent of original size [2023-02-15 19:27:57,348 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 46121 treesize of output 42009 [2023-02-15 19:27:57,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:27:57,684 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 118289 treesize of output 104993 [2023-02-15 19:28:03,642 WARN L233 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 1020 DAG size of output: 1008 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-02-15 19:28:04,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:28:04,232 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 116720 treesize of output 114080 [2023-02-15 19:28:06,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2023-02-15 19:28:06,842 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-15 19:28:06,946 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-15 19:28:08,517 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-15 19:28:08,612 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