./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/verifythis/tree_max.c -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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:09:42,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:09:42,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:09:42,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:09:42,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:09:42,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:09:42,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:09:42,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:09:42,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:09:42,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:09:42,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:09:42,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:09:42,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:09:42,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:09:42,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:09:42,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:09:42,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:09:42,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:09:42,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:09:42,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:09:42,800 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:09:42,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:09:42,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:09:42,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:09:42,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:09:42,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:09:42,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:09:42,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:09:42,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:09:42,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:09:42,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:09:42,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:09:42,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:09:42,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:09:42,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:09:42,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:09:42,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:09:42,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:09:42,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:09:42,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:09:42,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:09:42,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:09:42,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:09:42,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:09:42,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:09:42,849 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:09:42,849 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:09:42,850 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:09:42,850 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:09:42,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:09:42,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:09:42,851 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:09:42,852 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:09:42,852 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:09:42,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:09:42,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:09:42,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:09:42,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:09:42,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:09:42,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:09:42,853 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:09:42,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:09:42,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:09:42,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:09:42,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:09:42,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:09:42,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:09:42,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:42,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:09:42,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:09:42,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:09:42,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:09:42,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:09:42,857 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:09:42,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:09:42,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:09:42,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2022-07-13 18:09:43,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:09:43,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:09:43,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:09:43,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:09:43,090 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:09:43,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2022-07-13 18:09:43,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a9ede80/bb09c935117c4938add571bb95a269b4/FLAG13f8016d2 [2022-07-13 18:09:43,455 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:09:43,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2022-07-13 18:09:43,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a9ede80/bb09c935117c4938add571bb95a269b4/FLAG13f8016d2 [2022-07-13 18:09:43,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a9ede80/bb09c935117c4938add571bb95a269b4 [2022-07-13 18:09:43,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:09:43,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:09:43,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:43,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:09:43,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:09:43,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cceda3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43, skipping insertion in model container [2022-07-13 18:09:43,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:09:43,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:09:43,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-07-13 18:09:43,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:43,673 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:09:43,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c[544,557] [2022-07-13 18:09:43,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:09:43,714 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:09:43,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43 WrapperNode [2022-07-13 18:09:43,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:09:43,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:43,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:09:43,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:09:43,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,742 INFO L137 Inliner]: procedures = 24, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 38 [2022-07-13 18:09:43,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:09:43,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:09:43,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:09:43,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:09:43,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:09:43,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:09:43,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:09:43,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:09:43,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (1/1) ... [2022-07-13 18:09:43,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:09:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:43,797 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) [2022-07-13 18:09:43,799 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 [2022-07-13 18:09:43,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 18:09:43,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:09:43,824 INFO L130 BoogieDeclarations]: Found specification of procedure max [2022-07-13 18:09:43,824 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2022-07-13 18:09:43,825 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-07-13 18:09:43,825 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-07-13 18:09:43,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:09:43,825 INFO L130 BoogieDeclarations]: Found specification of procedure check [2022-07-13 18:09:43,825 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2022-07-13 18:09:43,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 18:09:43,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 18:09:43,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 18:09:43,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:09:43,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:09:43,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 18:09:43,902 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:09:43,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:09:44,105 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:09:44,118 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:09:44,119 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 18:09:44,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:44 BoogieIcfgContainer [2022-07-13 18:09:44,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:09:44,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:09:44,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:09:44,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:09:44,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:09:43" (1/3) ... [2022-07-13 18:09:44,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5045ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:44, skipping insertion in model container [2022-07-13 18:09:44,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:09:43" (2/3) ... [2022-07-13 18:09:44,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5045ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:09:44, skipping insertion in model container [2022-07-13 18:09:44,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:09:44" (3/3) ... [2022-07-13 18:09:44,134 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_max.c [2022-07-13 18:09:44,144 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:09:44,163 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:09:44,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:09:44,230 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d0f2889, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@451001bc [2022-07-13 18:09:44,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:09:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-13 18:09:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 18:09:44,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:44,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:09:44,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:44,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 998783614, now seen corresponding path program 1 times [2022-07-13 18:09:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:44,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614836838] [2022-07-13 18:09:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:44,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 18:09:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 18:09:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:44,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614836838] [2022-07-13 18:09:44,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614836838] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:44,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:44,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:09:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889585701] [2022-07-13 18:09:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:09:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:09:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:09:44,625 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:09:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:44,911 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-07-13 18:09:44,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:09:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-07-13 18:09:44,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:44,921 INFO L225 Difference]: With dead ends: 74 [2022-07-13 18:09:44,921 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 18:09:44,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:09:44,929 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:44,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 119 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:09:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 18:09:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-13 18:09:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-13 18:09:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-13 18:09:44,974 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 18 [2022-07-13 18:09:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:44,975 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-13 18:09:44,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 18:09:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-07-13 18:09:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 18:09:44,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:44,979 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:09:44,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:09:44,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash -976273983, now seen corresponding path program 1 times [2022-07-13 18:09:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:44,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591930370] [2022-07-13 18:09:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 18:09:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591930370] [2022-07-13 18:09:45,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591930370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:09:45,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:09:45,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 18:09:45,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664083398] [2022-07-13 18:09:45,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:09:45,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:09:45,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:45,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:09:45,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:09:45,193 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 18:09:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:45,390 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-07-13 18:09:45,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:09:45,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-07-13 18:09:45,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:45,392 INFO L225 Difference]: With dead ends: 48 [2022-07-13 18:09:45,392 INFO L226 Difference]: Without dead ends: 37 [2022-07-13 18:09:45,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:09:45,394 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 36 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:45,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 108 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:09:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-13 18:09:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-13 18:09:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-13 18:09:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-07-13 18:09:45,402 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 28 [2022-07-13 18:09:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-07-13 18:09:45,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 18:09:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-07-13 18:09:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 18:09:45,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:45,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 18:09:45,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:09:45,405 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:45,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1376325807, now seen corresponding path program 1 times [2022-07-13 18:09:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:45,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453184855] [2022-07-13 18:09:45,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:45,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:09:45,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453184855] [2022-07-13 18:09:45,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453184855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692980405] [2022-07-13 18:09:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:45,611 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) [2022-07-13 18:09:45,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 18:09:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:45,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-13 18:09:45,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:45,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:09:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 18:09:45,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:09:46,131 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 18:09:46,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-13 18:09:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:09:46,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692980405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:09:46,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:09:46,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 22 [2022-07-13 18:09:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013488889] [2022-07-13 18:09:46,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:09:46,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 18:09:46,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:09:46,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 18:09:46,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2022-07-13 18:09:46,163 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 22 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 18:09:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:09:46,659 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-07-13 18:09:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 18:09:46,660 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 41 [2022-07-13 18:09:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:09:46,661 INFO L225 Difference]: With dead ends: 46 [2022-07-13 18:09:46,661 INFO L226 Difference]: Without dead ends: 44 [2022-07-13 18:09:46,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 18:09:46,662 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 72 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:09:46,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 164 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:09:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-13 18:09:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-07-13 18:09:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-13 18:09:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-07-13 18:09:46,667 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 41 [2022-07-13 18:09:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:09:46,667 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-07-13 18:09:46,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 18:09:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-07-13 18:09:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 18:09:46,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:09:46,669 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-07-13 18:09:46,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 18:09:46,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:46,888 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:09:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:09:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2126921006, now seen corresponding path program 1 times [2022-07-13 18:09:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:09:46,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787099310] [2022-07-13 18:09:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:09:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:09:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:09:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:09:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:09:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:09:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 18:09:47,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:09:47,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787099310] [2022-07-13 18:09:47,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787099310] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:09:47,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992078853] [2022-07-13 18:09:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:09:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:09:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:09:47,256 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) [2022-07-13 18:09:47,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 18:09:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:09:47,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 18:09:47,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:09:47,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:09:47,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:09:47,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:09:47,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:09:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 18:09:47,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:09:55,845 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 18:10:01,925 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 18:10:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:10:02,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992078853] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:02,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:02,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 13] total 29 [2022-07-13 18:10:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266323015] [2022-07-13 18:10:02,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 18:10:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 18:10:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=732, Unknown=1, NotChecked=0, Total=812 [2022-07-13 18:10:02,003 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 29 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (19), 6 states have call predecessors, (19), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-07-13 18:10:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:03,024 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-07-13 18:10:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 18:10:03,025 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (19), 6 states have call predecessors, (19), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 47 [2022-07-13 18:10:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:03,035 INFO L225 Difference]: With dead ends: 76 [2022-07-13 18:10:03,036 INFO L226 Difference]: Without dead ends: 64 [2022-07-13 18:10:03,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=239, Invalid=1922, Unknown=1, NotChecked=0, Total=2162 [2022-07-13 18:10:03,037 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 101 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:03,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 335 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 914 Invalid, 0 Unknown, 160 Unchecked, 0.5s Time] [2022-07-13 18:10:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-13 18:10:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2022-07-13 18:10:03,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2022-07-13 18:10:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-07-13 18:10:03,054 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 47 [2022-07-13 18:10:03,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:03,054 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-07-13 18:10:03,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 11 states have call successors, (19), 6 states have call predecessors, (19), 7 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2022-07-13 18:10:03,055 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-07-13 18:10:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 18:10:03,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:03,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1] [2022-07-13 18:10:03,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:03,276 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,SelfDestructingSolverStorable3 [2022-07-13 18:10:03,276 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2051682644, now seen corresponding path program 1 times [2022-07-13 18:10:03,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:03,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740232871] [2022-07-13 18:10:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:03,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:10:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 18:10:03,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:03,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740232871] [2022-07-13 18:10:03,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740232871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:03,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980313532] [2022-07-13 18:10:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:03,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:03,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:03,533 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) [2022-07-13 18:10:03,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 18:10:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:03,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 18:10:03,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:03,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:10:03,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:10:03,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:03,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:10:03,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:12,162 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 18:10:18,251 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 18:10:18,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 18:10:18,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980313532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:18,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:18,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 13] total 28 [2022-07-13 18:10:18,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71279667] [2022-07-13 18:10:18,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:18,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 18:10:18,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 18:10:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=686, Unknown=1, NotChecked=0, Total=756 [2022-07-13 18:10:18,345 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 28 states, 24 states have (on average 2.375) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2022-07-13 18:10:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:19,212 INFO L93 Difference]: Finished difference Result 152 states and 212 transitions. [2022-07-13 18:10:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 18:10:19,212 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.375) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) Word has length 47 [2022-07-13 18:10:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:19,213 INFO L225 Difference]: With dead ends: 152 [2022-07-13 18:10:19,213 INFO L226 Difference]: Without dead ends: 90 [2022-07-13 18:10:19,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=212, Invalid=1949, Unknown=1, NotChecked=0, Total=2162 [2022-07-13 18:10:19,215 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:19,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 222 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 788 Invalid, 0 Unknown, 61 Unchecked, 0.4s Time] [2022-07-13 18:10:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-13 18:10:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-07-13 18:10:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (32), 15 states have call predecessors, (32), 10 states have call successors, (32) [2022-07-13 18:10:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2022-07-13 18:10:19,226 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 47 [2022-07-13 18:10:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:19,227 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2022-07-13 18:10:19,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.375) internal successors, (57), 21 states have internal predecessors, (57), 10 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17) [2022-07-13 18:10:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2022-07-13 18:10:19,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 18:10:19,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:19,230 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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, 1, 1, 1] [2022-07-13 18:10:19,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:19,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:19,440 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:19,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash -945278837, now seen corresponding path program 2 times [2022-07-13 18:10:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:19,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772486365] [2022-07-13 18:10:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:19,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 18:10:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772486365] [2022-07-13 18:10:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772486365] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169812637] [2022-07-13 18:10:20,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:10:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:20,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:20,092 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) [2022-07-13 18:10:20,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 18:10:20,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:10:20,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:10:20,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-13 18:10:20,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:20,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-13 18:10:20,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-07-13 18:10:20,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-13 18:10:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 18:10:20,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:21,553 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:10:21,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 32 [2022-07-13 18:10:21,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169812637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:21,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:21,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 47 [2022-07-13 18:10:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545284878] [2022-07-13 18:10:21,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:21,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-13 18:10:21,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:21,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-13 18:10:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3142, Unknown=0, NotChecked=0, Total=3306 [2022-07-13 18:10:21,752 INFO L87 Difference]: Start difference. First operand 87 states and 122 transitions. Second operand has 47 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 34 states have internal predecessors, (66), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 18:10:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:24,512 INFO L93 Difference]: Finished difference Result 163 states and 287 transitions. [2022-07-13 18:10:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 18:10:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 34 states have internal predecessors, (66), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) Word has length 70 [2022-07-13 18:10:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:24,516 INFO L225 Difference]: With dead ends: 163 [2022-07-13 18:10:24,516 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 18:10:24,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=546, Invalid=7110, Unknown=0, NotChecked=0, Total=7656 [2022-07-13 18:10:24,521 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 163 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:24,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 384 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 18:10:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 18:10:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2022-07-13 18:10:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 96 states have (on average 1.21875) internal successors, (117), 98 states have internal predecessors, (117), 20 states have call successors, (20), 11 states have call predecessors, (20), 17 states have return successors, (86), 24 states have call predecessors, (86), 12 states have call successors, (86) [2022-07-13 18:10:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 223 transitions. [2022-07-13 18:10:24,565 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 223 transitions. Word has length 70 [2022-07-13 18:10:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:24,565 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 223 transitions. [2022-07-13 18:10:24,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 34 states have internal predecessors, (66), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 18:10:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 223 transitions. [2022-07-13 18:10:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:10:24,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:24,568 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 18:10:24,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:24,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:24,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:24,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash -909256420, now seen corresponding path program 1 times [2022-07-13 18:10:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:24,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288613782] [2022-07-13 18:10:24,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 18:10:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:25,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288613782] [2022-07-13 18:10:25,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288613782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:25,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102390764] [2022-07-13 18:10:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:25,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:25,380 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) [2022-07-13 18:10:25,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 18:10:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:25,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-13 18:10:25,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:26,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-13 18:10:26,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 13 [2022-07-13 18:10:26,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-13 18:10:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 18:10:26,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:27,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:10:27,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 38 [2022-07-13 18:10:27,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102390764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:27,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:27,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 50 [2022-07-13 18:10:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270868921] [2022-07-13 18:10:27,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:27,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 18:10:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 18:10:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3737, Unknown=0, NotChecked=0, Total=3906 [2022-07-13 18:10:27,550 INFO L87 Difference]: Start difference. First operand 134 states and 223 transitions. Second operand has 50 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 35 states have internal predecessors, (68), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 18:10:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:32,397 INFO L93 Difference]: Finished difference Result 335 states and 640 transitions. [2022-07-13 18:10:32,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-13 18:10:32,398 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 35 states have internal predecessors, (68), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) Word has length 71 [2022-07-13 18:10:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:32,400 INFO L225 Difference]: With dead ends: 335 [2022-07-13 18:10:32,400 INFO L226 Difference]: Without dead ends: 223 [2022-07-13 18:10:32,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=874, Invalid=11558, Unknown=0, NotChecked=0, Total=12432 [2022-07-13 18:10:32,404 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 184 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:32,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 415 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-13 18:10:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-13 18:10:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 152. [2022-07-13 18:10:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.212962962962963) internal successors, (131), 114 states have internal predecessors, (131), 20 states have call successors, (20), 11 states have call predecessors, (20), 23 states have return successors, (122), 26 states have call predecessors, (122), 12 states have call successors, (122) [2022-07-13 18:10:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 273 transitions. [2022-07-13 18:10:32,427 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 273 transitions. Word has length 71 [2022-07-13 18:10:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:32,427 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 273 transitions. [2022-07-13 18:10:32,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 35 states have internal predecessors, (68), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 18:10:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 273 transitions. [2022-07-13 18:10:32,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:10:32,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:32,429 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 18:10:32,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:32,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:32,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:32,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1931785932, now seen corresponding path program 2 times [2022-07-13 18:10:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:32,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643608291] [2022-07-13 18:10:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:10:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:32,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643608291] [2022-07-13 18:10:32,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643608291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:32,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579681739] [2022-07-13 18:10:32,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:10:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:32,840 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) [2022-07-13 18:10:32,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:10:32,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:10:32,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:10:32,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 18:10:32,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:10:33,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:10:33,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579681739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:33,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:33,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 21 [2022-07-13 18:10:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784030950] [2022-07-13 18:10:33,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:33,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 18:10:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 18:10:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-07-13 18:10:33,351 INFO L87 Difference]: Start difference. First operand 152 states and 273 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:10:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:34,373 INFO L93 Difference]: Finished difference Result 305 states and 646 transitions. [2022-07-13 18:10:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 18:10:34,373 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) Word has length 71 [2022-07-13 18:10:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:34,375 INFO L225 Difference]: With dead ends: 305 [2022-07-13 18:10:34,375 INFO L226 Difference]: Without dead ends: 175 [2022-07-13 18:10:34,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=379, Invalid=1877, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 18:10:34,377 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 109 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:34,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 297 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:10:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-13 18:10:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2022-07-13 18:10:34,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.168141592920354) internal successors, (132), 118 states have internal predecessors, (132), 20 states have call successors, (20), 11 states have call predecessors, (20), 24 states have return successors, (129), 28 states have call predecessors, (129), 12 states have call successors, (129) [2022-07-13 18:10:34,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 281 transitions. [2022-07-13 18:10:34,393 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 281 transitions. Word has length 71 [2022-07-13 18:10:34,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:34,393 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 281 transitions. [2022-07-13 18:10:34,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 14 states have internal predecessors, (43), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 9 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 18:10:34,393 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 281 transitions. [2022-07-13 18:10:34,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:10:34,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:34,395 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 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, 1, 1, 1] [2022-07-13 18:10:34,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:34,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:34,618 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:34,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:34,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1914561797, now seen corresponding path program 1 times [2022-07-13 18:10:34,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:34,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802441286] [2022-07-13 18:10:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:34,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:34,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 26 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 18:10:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:35,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802441286] [2022-07-13 18:10:35,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802441286] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:35,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457262439] [2022-07-13 18:10:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:35,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:35,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:35,257 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) [2022-07-13 18:10:35,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 18:10:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:35,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-13 18:10:35,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:36,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-07-13 18:10:36,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-13 18:10:36,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 18:10:36,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:37,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:10:37,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 36 [2022-07-13 18:10:37,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457262439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:37,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:37,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 54 [2022-07-13 18:10:37,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108888547] [2022-07-13 18:10:37,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:37,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-13 18:10:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-13 18:10:37,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 18:10:37,825 INFO L87 Difference]: Start difference. First operand 158 states and 281 transitions. Second operand has 54 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 38 states have internal predecessors, (70), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 18:10:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:41,465 INFO L93 Difference]: Finished difference Result 191 states and 326 transitions. [2022-07-13 18:10:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-13 18:10:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 38 states have internal predecessors, (70), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) Word has length 72 [2022-07-13 18:10:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:41,467 INFO L225 Difference]: With dead ends: 191 [2022-07-13 18:10:41,467 INFO L226 Difference]: Without dead ends: 189 [2022-07-13 18:10:41,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=739, Invalid=10181, Unknown=0, NotChecked=0, Total=10920 [2022-07-13 18:10:41,470 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 172 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 2594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:41,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 381 Invalid, 2594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 18:10:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-13 18:10:41,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 153. [2022-07-13 18:10:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 109 states have (on average 1.165137614678899) internal successors, (127), 114 states have internal predecessors, (127), 20 states have call successors, (20), 11 states have call predecessors, (20), 23 states have return successors, (123), 27 states have call predecessors, (123), 12 states have call successors, (123) [2022-07-13 18:10:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 270 transitions. [2022-07-13 18:10:41,497 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 270 transitions. Word has length 72 [2022-07-13 18:10:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:41,497 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 270 transitions. [2022-07-13 18:10:41,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 38 states have internal predecessors, (70), 16 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-13 18:10:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 270 transitions. [2022-07-13 18:10:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:10:41,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:41,498 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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, 1, 1, 1, 1, 1] [2022-07-13 18:10:41,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:41,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:41,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash 872853690, now seen corresponding path program 1 times [2022-07-13 18:10:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48438026] [2022-07-13 18:10:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 18:10:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:42,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48438026] [2022-07-13 18:10:42,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48438026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:42,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30100916] [2022-07-13 18:10:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:42,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:42,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:42,268 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) [2022-07-13 18:10:42,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 18:10:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:42,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-13 18:10:42,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:42,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-07-13 18:10:42,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-13 18:10:42,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 18:10:42,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:43,207 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-07-13 18:10:43,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-07-13 18:10:43,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30100916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:43,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:43,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21] total 43 [2022-07-13 18:10:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682388338] [2022-07-13 18:10:43,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:43,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 18:10:43,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:43,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 18:10:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2218, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 18:10:43,328 INFO L87 Difference]: Start difference. First operand 153 states and 270 transitions. Second operand has 43 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 31 states have internal predecessors, (66), 15 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (17), 14 states have call predecessors, (17), 11 states have call successors, (17) [2022-07-13 18:10:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:44,832 INFO L93 Difference]: Finished difference Result 189 states and 309 transitions. [2022-07-13 18:10:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-13 18:10:44,833 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 31 states have internal predecessors, (66), 15 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (17), 14 states have call predecessors, (17), 11 states have call successors, (17) Word has length 72 [2022-07-13 18:10:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:44,843 INFO L225 Difference]: With dead ends: 189 [2022-07-13 18:10:44,843 INFO L226 Difference]: Without dead ends: 187 [2022-07-13 18:10:44,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=4469, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 18:10:44,845 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 94 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:44,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 337 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 18:10:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-13 18:10:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 136. [2022-07-13 18:10:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.183673469387755) internal successors, (116), 99 states have internal predecessors, (116), 19 states have call successors, (19), 10 states have call predecessors, (19), 18 states have return successors, (93), 26 states have call predecessors, (93), 12 states have call successors, (93) [2022-07-13 18:10:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 228 transitions. [2022-07-13 18:10:44,860 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 228 transitions. Word has length 72 [2022-07-13 18:10:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:44,860 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 228 transitions. [2022-07-13 18:10:44,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 31 states have internal predecessors, (66), 15 states have call successors, (22), 6 states have call predecessors, (22), 7 states have return successors, (17), 14 states have call predecessors, (17), 11 states have call successors, (17) [2022-07-13 18:10:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 228 transitions. [2022-07-13 18:10:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 18:10:44,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:44,863 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:10:44,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:45,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 18:10:45,077 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash -666655302, now seen corresponding path program 2 times [2022-07-13 18:10:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:45,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562761547] [2022-07-13 18:10:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 18:10:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:10:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-13 18:10:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:45,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562761547] [2022-07-13 18:10:45,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562761547] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:45,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386716916] [2022-07-13 18:10:45,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:10:45,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:45,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:45,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:45,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 18:10:45,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:10:45,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:10:45,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-13 18:10:45,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:45,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:10:45,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:10:45,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:10:45,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:10:45,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:45,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-13 18:10:45,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-13 18:10:46,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386716916] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:10:46,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:10:46,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 14] total 25 [2022-07-13 18:10:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935543164] [2022-07-13 18:10:46,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:46,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-13 18:10:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 18:10:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2022-07-13 18:10:46,065 INFO L87 Difference]: Start difference. First operand 136 states and 228 transitions. Second operand has 25 states, 23 states have (on average 2.217391304347826) internal successors, (51), 17 states have internal predecessors, (51), 8 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-13 18:10:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:46,283 INFO L93 Difference]: Finished difference Result 243 states and 415 transitions. [2022-07-13 18:10:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 18:10:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.217391304347826) internal successors, (51), 17 states have internal predecessors, (51), 8 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) Word has length 60 [2022-07-13 18:10:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:46,286 INFO L225 Difference]: With dead ends: 243 [2022-07-13 18:10:46,286 INFO L226 Difference]: Without dead ends: 141 [2022-07-13 18:10:46,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2022-07-13 18:10:46,287 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:46,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 482 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 84 Unchecked, 0.1s Time] [2022-07-13 18:10:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-13 18:10:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-13 18:10:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 102 states have internal predecessors, (119), 20 states have call successors, (20), 10 states have call predecessors, (20), 19 states have return successors, (99), 28 states have call predecessors, (99), 13 states have call successors, (99) [2022-07-13 18:10:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 238 transitions. [2022-07-13 18:10:46,299 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 238 transitions. Word has length 60 [2022-07-13 18:10:46,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:46,300 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 238 transitions. [2022-07-13 18:10:46,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.217391304347826) internal successors, (51), 17 states have internal predecessors, (51), 8 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-13 18:10:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 238 transitions. [2022-07-13 18:10:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 18:10:46,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:46,302 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 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, 1, 1, 1] [2022-07-13 18:10:46,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:46,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:46,519 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1479239555, now seen corresponding path program 3 times [2022-07-13 18:10:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:46,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806157476] [2022-07-13 18:10:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:10:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:10:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 18:10:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:46,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806157476] [2022-07-13 18:10:46,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806157476] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:46,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168221072] [2022-07-13 18:10:46,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:10:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:46,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:46,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 18:10:47,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-13 18:10:47,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:10:47,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-13 18:10:47,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:47,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 18:10:47,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:10:47,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-07-13 18:10:47,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-13 18:10:47,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 18:10:47,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:47,573 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-07-13 18:10:47,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-07-13 18:10:47,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168221072] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:47,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:47,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 30 [2022-07-13 18:10:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483323264] [2022-07-13 18:10:47,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:47,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 18:10:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:47,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 18:10:47,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2022-07-13 18:10:47,670 INFO L87 Difference]: Start difference. First operand 141 states and 238 transitions. Second operand has 30 states, 25 states have (on average 2.04) internal successors, (51), 23 states have internal predecessors, (51), 12 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-13 18:10:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:48,647 INFO L93 Difference]: Finished difference Result 168 states and 272 transitions. [2022-07-13 18:10:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 18:10:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.04) internal successors, (51), 23 states have internal predecessors, (51), 12 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) Word has length 70 [2022-07-13 18:10:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:48,649 INFO L225 Difference]: With dead ends: 168 [2022-07-13 18:10:48,649 INFO L226 Difference]: Without dead ends: 166 [2022-07-13 18:10:48,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=2908, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 18:10:48,650 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 81 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:48,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 265 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 18:10:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-13 18:10:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2022-07-13 18:10:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 115 states have internal predecessors, (133), 23 states have call successors, (23), 12 states have call predecessors, (23), 20 states have return successors, (105), 30 states have call predecessors, (105), 13 states have call successors, (105) [2022-07-13 18:10:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 261 transitions. [2022-07-13 18:10:48,663 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 261 transitions. Word has length 70 [2022-07-13 18:10:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:48,664 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 261 transitions. [2022-07-13 18:10:48,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.04) internal successors, (51), 23 states have internal predecessors, (51), 12 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-13 18:10:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 261 transitions. [2022-07-13 18:10:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:10:48,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:48,666 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1] [2022-07-13 18:10:48,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 18:10:48,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 18:10:48,881 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1086227410, now seen corresponding path program 1 times [2022-07-13 18:10:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928534618] [2022-07-13 18:10:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:10:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:10:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 18:10:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928534618] [2022-07-13 18:10:49,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928534618] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:49,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265096253] [2022-07-13 18:10:49,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:49,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:49,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:49,444 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:49,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 18:10:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:49,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-13 18:10:49,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:49,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:10:49,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:10:50,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-07-13 18:10:50,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-13 18:10:50,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 18:10:50,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:51,212 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-07-13 18:10:51,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 30 [2022-07-13 18:10:51,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265096253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:51,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:10:51,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 47 [2022-07-13 18:10:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296683816] [2022-07-13 18:10:51,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:10:51,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-13 18:10:51,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:10:51,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-13 18:10:51,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3724, Unknown=0, NotChecked=0, Total=3906 [2022-07-13 18:10:51,489 INFO L87 Difference]: Start difference. First operand 158 states and 261 transitions. Second operand has 47 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 34 states have internal predecessors, (64), 15 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-13 18:10:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:10:53,663 INFO L93 Difference]: Finished difference Result 202 states and 370 transitions. [2022-07-13 18:10:53,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 18:10:53,664 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 34 states have internal predecessors, (64), 15 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 71 [2022-07-13 18:10:53,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:10:53,665 INFO L225 Difference]: With dead ends: 202 [2022-07-13 18:10:53,665 INFO L226 Difference]: Without dead ends: 200 [2022-07-13 18:10:53,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=546, Invalid=7644, Unknown=0, NotChecked=0, Total=8190 [2022-07-13 18:10:53,666 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 114 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:10:53,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 403 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 18:10:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-13 18:10:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 169. [2022-07-13 18:10:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 121 states have (on average 1.165289256198347) internal successors, (141), 123 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 22 states have return successors, (136), 33 states have call predecessors, (136), 15 states have call successors, (136) [2022-07-13 18:10:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 302 transitions. [2022-07-13 18:10:53,683 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 302 transitions. Word has length 71 [2022-07-13 18:10:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:10:53,684 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 302 transitions. [2022-07-13 18:10:53,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 34 states have internal predecessors, (64), 15 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-13 18:10:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 302 transitions. [2022-07-13 18:10:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 18:10:53,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:10:53,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 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, 1, 1, 1] [2022-07-13 18:10:53,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 18:10:53,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 18:10:53,907 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:10:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:10:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1479346186, now seen corresponding path program 1 times [2022-07-13 18:10:53,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:10:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403632042] [2022-07-13 18:10:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:10:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:10:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:10:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:10:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:10:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:10:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 18:10:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:10:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403632042] [2022-07-13 18:10:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403632042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:10:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838183288] [2022-07-13 18:10:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:10:54,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:10:54,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:10:54,518 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:10:54,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 18:10:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:10:54,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-13 18:10:54,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:10:54,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:54,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:10:54,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:10:54,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:10:54,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:10:54,929 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 18:10:54,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:10:54,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:10:54,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-13 18:10:55,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:10:55,767 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:10:55,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:10:55,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 37 [2022-07-13 18:10:55,774 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 18:10:55,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-13 18:10:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 18:10:55,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:10:56,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:10:56,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:10:58,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_7 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_26 Int)) (or (let ((.cse0 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 8)) (.cse1 (+ 4 |c_nondet_tree_#res.offset|))) (and (= (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_7 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_7) .cse0 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse1) 0) (= (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_7 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_7) .cse0 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse1) 0))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_BEFORE_CALL_7) 0) (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 4) 0) (not (= v_nondet_tree_~n~0.base_BEFORE_CALL_7 0))))) is different from false [2022-07-13 18:11:00,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_7 Int) (v_ArrVal_1450 Int) (v_ArrVal_1448 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_26 Int)) (or (let ((.cse1 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 8)) (.cse2 (+ 8 c_nondet_tree_~n~0.offset)) (.cse3 (+ 4 c_nondet_tree_~n~0.offset))) (and (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base) .cse2 v_ArrVal_1450)))) (store .cse0 v_nondet_tree_~n~0.base_BEFORE_CALL_7 (store (select .cse0 v_nondet_tree_~n~0.base_BEFORE_CALL_7) .cse1 c_nondet_tree_~n~0.base))) c_nondet_tree_~n~0.base) .cse3) 0) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| c_nondet_tree_~n~0.base) .cse2 v_ArrVal_1448)))) (store .cse4 v_nondet_tree_~n~0.base_BEFORE_CALL_7 (store (select .cse4 v_nondet_tree_~n~0.base_BEFORE_CALL_7) .cse1 c_nondet_tree_~n~0.offset))) c_nondet_tree_~n~0.base) .cse3) 0))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_BEFORE_CALL_7) 0) (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 4) 0) (not (= v_nondet_tree_~n~0.base_BEFORE_CALL_7 0))))) is different from false [2022-07-13 18:11:02,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_7 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_26 Int)) (or (and (forall ((v_ArrVal_1448 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| c_nondet_tree_~n~0.base) (+ 8 c_nondet_tree_~n~0.offset) v_ArrVal_1448)))) (store .cse0 v_nondet_tree_~n~0.base_BEFORE_CALL_7 (store (select .cse0 v_nondet_tree_~n~0.base_BEFORE_CALL_7) (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 8) c_nondet_tree_~n~0.offset))) c_nondet_tree_~n~0.base) (+ 4 c_nondet_tree_~n~0.offset)) 0)) (forall ((v_ArrVal_1450 Int)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base) (+ 8 c_nondet_tree_~n~0.offset) v_ArrVal_1450)))) (store .cse1 v_nondet_tree_~n~0.base_BEFORE_CALL_7 (store (select .cse1 v_nondet_tree_~n~0.base_BEFORE_CALL_7) (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 8) c_nondet_tree_~n~0.base))) c_nondet_tree_~n~0.base) (+ 4 c_nondet_tree_~n~0.offset)) 0))) (and (= (select |c_old(#valid)| v_nondet_tree_~n~0.base_BEFORE_CALL_7) 0) (= (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_26 4) 0) (not (= v_nondet_tree_~n~0.base_BEFORE_CALL_7 0))))) is different from false [2022-07-13 18:11:02,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838183288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:02,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:11:02,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2022-07-13 18:11:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392842653] [2022-07-13 18:11:02,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:02,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-13 18:11:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-13 18:11:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2911, Unknown=3, NotChecked=330, Total=3422 [2022-07-13 18:11:02,704 INFO L87 Difference]: Start difference. First operand 169 states and 302 transitions. Second operand has 46 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 34 states have internal predecessors, (79), 18 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) [2022-07-13 18:11:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:11:05,459 INFO L93 Difference]: Finished difference Result 452 states and 844 transitions. [2022-07-13 18:11:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-07-13 18:11:05,460 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 34 states have internal predecessors, (79), 18 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) Word has length 76 [2022-07-13 18:11:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:11:05,464 INFO L225 Difference]: With dead ends: 452 [2022-07-13 18:11:05,464 INFO L226 Difference]: Without dead ends: 440 [2022-07-13 18:11:05,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=650, Invalid=10489, Unknown=3, NotChecked=630, Total=11772 [2022-07-13 18:11:05,466 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 122 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 634 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:11:05,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 694 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1791 Invalid, 0 Unknown, 634 Unchecked, 0.9s Time] [2022-07-13 18:11:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-07-13 18:11:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 339. [2022-07-13 18:11:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 248 states have (on average 1.189516129032258) internal successors, (295), 254 states have internal predecessors, (295), 38 states have call successors, (38), 21 states have call predecessors, (38), 52 states have return successors, (326), 63 states have call predecessors, (326), 22 states have call successors, (326) [2022-07-13 18:11:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 659 transitions. [2022-07-13 18:11:05,497 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 659 transitions. Word has length 76 [2022-07-13 18:11:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:11:05,497 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 659 transitions. [2022-07-13 18:11:05,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 34 states have internal predecessors, (79), 18 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) [2022-07-13 18:11:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 659 transitions. [2022-07-13 18:11:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:11:05,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:11:05,512 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 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, 1, 1, 1] [2022-07-13 18:11:05,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 18:11:05,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 18:11:05,727 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:11:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:11:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1523837565, now seen corresponding path program 1 times [2022-07-13 18:11:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:11:05,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199986882] [2022-07-13 18:11:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:11:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:11:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:11:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 18:11:05,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:11:05,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199986882] [2022-07-13 18:11:05,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199986882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:05,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954510717] [2022-07-13 18:11:05,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:05,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:05,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:11:05,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:11:05,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 18:11:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:06,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-13 18:11:06,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:11:06,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-13 18:11:06,347 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 18:11:06,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:11:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 18:11:06,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954510717] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:11:06,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:11:06,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 30 [2022-07-13 18:11:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846788442] [2022-07-13 18:11:06,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:06,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 18:11:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:06,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 18:11:06,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2022-07-13 18:11:06,707 INFO L87 Difference]: Start difference. First operand 339 states and 659 transitions. Second operand has 30 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 13 states have call successors, (27), 4 states have call predecessors, (27), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-13 18:11:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:11:07,382 INFO L93 Difference]: Finished difference Result 493 states and 970 transitions. [2022-07-13 18:11:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 18:11:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 13 states have call successors, (27), 4 states have call predecessors, (27), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) Word has length 72 [2022-07-13 18:11:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:11:07,387 INFO L225 Difference]: With dead ends: 493 [2022-07-13 18:11:07,387 INFO L226 Difference]: Without dead ends: 466 [2022-07-13 18:11:07,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 146 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=1679, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 18:11:07,391 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 86 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:11:07,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 454 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 535 Invalid, 0 Unknown, 305 Unchecked, 0.3s Time] [2022-07-13 18:11:07,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-07-13 18:11:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 370. [2022-07-13 18:11:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 271 states have (on average 1.2029520295202951) internal successors, (326), 275 states have internal predecessors, (326), 42 states have call successors, (42), 24 states have call predecessors, (42), 56 states have return successors, (290), 70 states have call predecessors, (290), 26 states have call successors, (290) [2022-07-13 18:11:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 658 transitions. [2022-07-13 18:11:07,422 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 658 transitions. Word has length 72 [2022-07-13 18:11:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:11:07,423 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 658 transitions. [2022-07-13 18:11:07,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 3.0) internal successors, (75), 25 states have internal predecessors, (75), 13 states have call successors, (27), 4 states have call predecessors, (27), 11 states have return successors, (21), 15 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-13 18:11:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 658 transitions. [2022-07-13 18:11:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 18:11:07,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:11:07,426 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 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] [2022-07-13 18:11:07,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 18:11:07,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 18:11:07,639 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:11:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:11:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1595709832, now seen corresponding path program 3 times [2022-07-13 18:11:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:11:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909515603] [2022-07-13 18:11:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:11:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:07,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:11:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 18:11:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:11:08,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909515603] [2022-07-13 18:11:08,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909515603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:08,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95243487] [2022-07-13 18:11:08,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:11:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:11:08,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:11:08,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 18:11:08,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 18:11:08,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:11:08,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-13 18:11:08,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:11:08,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 18:11:08,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 18:11:08,494 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-13 18:11:08,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-13 18:11:08,507 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-13 18:11:08,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-13 18:11:11,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:11:11,951 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 18:11:11,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 45 [2022-07-13 18:11:11,963 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-13 18:11:11,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 18 [2022-07-13 18:11:12,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-07-13 18:11:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 18:11:12,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:11:12,736 INFO L356 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2022-07-13 18:11:12,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 47 [2022-07-13 18:11:12,987 INFO L356 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2022-07-13 18:11:12,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 47 [2022-07-13 18:11:15,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((nondet_tree_~n~0.base Int)) (let ((.cse2 (+ 8 c_nondet_tree_~n~0.offset)) (.cse3 (+ |c_nondet_tree_#t~ret9.offset| 8))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#t~ret9.offset|)) |c_nondet_tree_#t~ret9.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#t~ret9.base|)) |c_nondet_tree_#t~ret9.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse1 c_nondet_tree_~n~0.offset) (= .cse0 nondet_tree_~n~0.base)))))) is different from false [2022-07-13 18:11:17,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((nondet_tree_~n~0.base Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_33 Int)) (let ((.cse2 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_33 8)) (.cse3 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse3)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse0 v_nondet_tree_~n~0.offset_BEFORE_CALL_33) (= .cse1 nondet_tree_~n~0.base)))))) is different from false [2022-07-13 18:11:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 5 not checked. [2022-07-13 18:11:17,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95243487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:11:17,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:11:17,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 23] total 63 [2022-07-13 18:11:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917985394] [2022-07-13 18:11:17,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:17,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-13 18:11:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-13 18:11:17,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3470, Unknown=3, NotChecked=238, Total=3906 [2022-07-13 18:11:17,529 INFO L87 Difference]: Start difference. First operand 370 states and 658 transitions. Second operand has 63 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 42 states have internal predecessors, (101), 18 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (24), 19 states have call predecessors, (24), 10 states have call successors, (24) [2022-07-13 18:11:19,718 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_nondet_tree_#res.offset|) (= (select |c_old(#valid)| c_nondet_tree_~n~0.base) 0) (forall ((nondet_tree_~n~0.base Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_33 Int)) (let ((.cse2 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_33 8)) (.cse3 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse3)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse0 v_nondet_tree_~n~0.offset_BEFORE_CALL_33) (= .cse1 nondet_tree_~n~0.base)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) 8) 0) (not (= (select |c_#valid| c_nondet_tree_~n~0.base) 0)) (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) 8) 0) (= (select |c_old(#valid)| |c_nondet_tree_#res.base|) 0) (= c_nondet_tree_~n~0.offset 0)) is different from false [2022-07-13 18:11:21,723 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_nondet_tree_#res.offset|) (forall ((nondet_tree_~n~0.base Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_33 Int)) (let ((.cse2 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_33 8)) (.cse3 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse3)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse0 v_nondet_tree_~n~0.offset_BEFORE_CALL_33) (= .cse1 nondet_tree_~n~0.base)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) 8) 0) (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) 8) 0) (= (select |c_old(#valid)| |c_nondet_tree_#res.base|) 0)) is different from false [2022-07-13 18:11:23,743 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_nondet_tree_#res.offset|) (= (select |c_old(#valid)| c_nondet_tree_~n~0.base) 0) (forall ((nondet_tree_~n~0.base Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_33 Int)) (let ((.cse2 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_33 8)) (.cse3 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse3)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse0 v_nondet_tree_~n~0.offset_BEFORE_CALL_33) (= .cse1 nondet_tree_~n~0.base)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) 8) 0) (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) 8) 0) (= (select |c_old(#valid)| |c_nondet_tree_#res.base|) 0) (= c_nondet_tree_~n~0.offset 0)) is different from false [2022-07-13 18:11:25,747 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#t~ret9.base|) 8) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#t~ret9.base|) 8) 0) (not (= |c_nondet_tree_#t~ret9.base| c_nondet_tree_~n~0.base)) (forall ((nondet_tree_~n~0.base Int)) (let ((.cse2 (+ 8 c_nondet_tree_~n~0.offset)) (.cse3 (+ |c_nondet_tree_#t~ret9.offset| 8))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#t~ret9.offset|)) |c_nondet_tree_#t~ret9.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#t~ret9.base|)) |c_nondet_tree_#t~ret9.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse1 c_nondet_tree_~n~0.offset) (= .cse0 nondet_tree_~n~0.base)))))) (= |c_nondet_tree_#t~ret9.offset| 0) (= c_nondet_tree_~n~0.offset 0)) is different from false [2022-07-13 18:11:32,661 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#t~ret9.base|) 8) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#t~ret9.base|) 8) 0) (forall ((nondet_tree_~n~0.base Int)) (let ((.cse2 (+ 8 c_nondet_tree_~n~0.offset)) (.cse3 (+ |c_nondet_tree_#t~ret9.offset| 8))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.offset| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#t~ret9.offset|)) |c_nondet_tree_#t~ret9.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| nondet_tree_~n~0.base (store (select |c_#memory_$Pointer$.base| nondet_tree_~n~0.base) .cse2 |c_nondet_tree_#t~ret9.base|)) |c_nondet_tree_#t~ret9.base|) .cse3))) (or (and (= .cse0 0) (= .cse1 0)) (and (= .cse1 c_nondet_tree_~n~0.offset) (= .cse0 nondet_tree_~n~0.base)))))) (= |c_nondet_tree_#t~ret9.offset| 0) (= c_nondet_tree_~n~0.offset 0)) is different from false [2022-07-13 18:11:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:11:38,327 INFO L93 Difference]: Finished difference Result 782 states and 1341 transitions. [2022-07-13 18:11:38,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-07-13 18:11:38,328 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 42 states have internal predecessors, (101), 18 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (24), 19 states have call predecessors, (24), 10 states have call successors, (24) Word has length 76 [2022-07-13 18:11:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:11:38,334 INFO L225 Difference]: With dead ends: 782 [2022-07-13 18:11:38,334 INFO L226 Difference]: Without dead ends: 741 [2022-07-13 18:11:38,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=888, Invalid=12704, Unknown=8, NotChecked=1652, Total=15252 [2022-07-13 18:11:38,337 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 196 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1078 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:11:38,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 636 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1864 Invalid, 0 Unknown, 1078 Unchecked, 1.1s Time] [2022-07-13 18:11:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-13 18:11:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 549. [2022-07-13 18:11:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 407 states have (on average 1.2113022113022114) internal successors, (493), 402 states have internal predecessors, (493), 65 states have call successors, (65), 40 states have call predecessors, (65), 76 states have return successors, (508), 106 states have call predecessors, (508), 35 states have call successors, (508) [2022-07-13 18:11:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1066 transitions. [2022-07-13 18:11:38,408 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1066 transitions. Word has length 76 [2022-07-13 18:11:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:11:38,408 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 1066 transitions. [2022-07-13 18:11:38,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 42 states have internal predecessors, (101), 18 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (24), 19 states have call predecessors, (24), 10 states have call successors, (24) [2022-07-13 18:11:38,409 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1066 transitions. [2022-07-13 18:11:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 18:11:38,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:11:38,414 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-13 18:11:38,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 18:11:38,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:38,632 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:11:38,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:11:38,632 INFO L85 PathProgramCache]: Analyzing trace with hash 215586468, now seen corresponding path program 2 times [2022-07-13 18:11:38,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:11:38,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164641679] [2022-07-13 18:11:38,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:38,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:11:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:38,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:38,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:11:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:11:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-13 18:11:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:11:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164641679] [2022-07-13 18:11:39,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164641679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256009931] [2022-07-13 18:11:39,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:11:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:39,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:11:39,334 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:11:39,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 18:11:39,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:11:39,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:11:39,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 18:11:39,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:11:40,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:11:40,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:11:40,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-13 18:11:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 59 proven. 69 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-13 18:11:40,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:11:40,600 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-07-13 18:11:40,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 30 [2022-07-13 18:11:40,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256009931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:40,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:11:40,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2022-07-13 18:11:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738289566] [2022-07-13 18:11:40,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 18:11:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 18:11:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1864, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 18:11:40,838 INFO L87 Difference]: Start difference. First operand 549 states and 1066 transitions. Second operand has 37 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 14 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (20), 12 states have call predecessors, (20), 11 states have call successors, (20) [2022-07-13 18:11:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:11:43,722 INFO L93 Difference]: Finished difference Result 1313 states and 2862 transitions. [2022-07-13 18:11:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-13 18:11:43,722 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 14 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (20), 12 states have call predecessors, (20), 11 states have call successors, (20) Word has length 97 [2022-07-13 18:11:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:11:43,734 INFO L225 Difference]: With dead ends: 1313 [2022-07-13 18:11:43,734 INFO L226 Difference]: Without dead ends: 1263 [2022-07-13 18:11:43,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=609, Invalid=7947, Unknown=0, NotChecked=0, Total=8556 [2022-07-13 18:11:43,736 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 212 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 289 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:11:43,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 463 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1939 Invalid, 0 Unknown, 289 Unchecked, 1.1s Time] [2022-07-13 18:11:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-13 18:11:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 796. [2022-07-13 18:11:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 596 states have (on average 1.238255033557047) internal successors, (738), 570 states have internal predecessors, (738), 96 states have call successors, (96), 59 states have call predecessors, (96), 103 states have return successors, (566), 166 states have call predecessors, (566), 61 states have call successors, (566) [2022-07-13 18:11:43,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1400 transitions. [2022-07-13 18:11:43,859 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1400 transitions. Word has length 97 [2022-07-13 18:11:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:11:43,861 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1400 transitions. [2022-07-13 18:11:43,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 2.433333333333333) internal successors, (73), 27 states have internal predecessors, (73), 14 states have call successors, (24), 7 states have call predecessors, (24), 9 states have return successors, (20), 12 states have call predecessors, (20), 11 states have call successors, (20) [2022-07-13 18:11:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1400 transitions. [2022-07-13 18:11:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:11:43,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:11:43,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 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, 1, 1, 1] [2022-07-13 18:11:43,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-13 18:11:44,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 18:11:44,087 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:11:44,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:11:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash 191480931, now seen corresponding path program 2 times [2022-07-13 18:11:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:11:44,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284700814] [2022-07-13 18:11:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:44,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:11:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:11:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:11:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:11:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 18:11:44,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:11:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284700814] [2022-07-13 18:11:44,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284700814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138439118] [2022-07-13 18:11:44,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:11:44,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:11:44,727 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:11:44,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 18:11:44,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:11:44,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:11:44,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-13 18:11:44,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:11:45,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 15 [2022-07-13 18:11:45,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-13 18:11:45,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:11:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 18:11:45,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:11:46,994 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-07-13 18:11:46,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 30 [2022-07-13 18:11:47,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138439118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:47,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:11:47,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 51 [2022-07-13 18:11:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354842118] [2022-07-13 18:11:47,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:47,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 18:11:47,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 18:11:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=4618, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 18:11:47,545 INFO L87 Difference]: Start difference. First operand 796 states and 1400 transitions. Second operand has 51 states, 40 states have (on average 1.675) internal successors, (67), 37 states have internal predecessors, (67), 15 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-13 18:11:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:11:52,731 INFO L93 Difference]: Finished difference Result 1162 states and 2606 transitions. [2022-07-13 18:11:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-13 18:11:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 40 states have (on average 1.675) internal successors, (67), 37 states have internal predecessors, (67), 15 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) Word has length 72 [2022-07-13 18:11:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:11:52,741 INFO L225 Difference]: With dead ends: 1162 [2022-07-13 18:11:52,741 INFO L226 Difference]: Without dead ends: 1160 [2022-07-13 18:11:52,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3448 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1095, Invalid=14405, Unknown=0, NotChecked=0, Total=15500 [2022-07-13 18:11:52,744 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 3865 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 3992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 18:11:52,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 448 Invalid, 3992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3865 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 18:11:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-07-13 18:11:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 785. [2022-07-13 18:11:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 589 states have (on average 1.2393887945670627) internal successors, (730), 562 states have internal predecessors, (730), 94 states have call successors, (94), 59 states have call predecessors, (94), 101 states have return successors, (547), 163 states have call predecessors, (547), 59 states have call successors, (547) [2022-07-13 18:11:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1371 transitions. [2022-07-13 18:11:52,827 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1371 transitions. Word has length 72 [2022-07-13 18:11:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:11:52,828 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 1371 transitions. [2022-07-13 18:11:52,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 40 states have (on average 1.675) internal successors, (67), 37 states have internal predecessors, (67), 15 states have call successors, (23), 6 states have call predecessors, (23), 8 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-13 18:11:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1371 transitions. [2022-07-13 18:11:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 18:11:52,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:11:52,832 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:11:52,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 18:11:53,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 18:11:53,051 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:11:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:11:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -700730293, now seen corresponding path program 4 times [2022-07-13 18:11:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:11:53,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260481174] [2022-07-13 18:11:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:11:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:11:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 44 proven. 27 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:11:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:11:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260481174] [2022-07-13 18:11:53,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260481174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746679692] [2022-07-13 18:11:53,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 18:11:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:11:53,601 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:11:53,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 18:11:54,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 18:11:54,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:11:54,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-13 18:11:54,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:11:54,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:11:54,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-13 18:11:54,385 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 18:11:54,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:11:54,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 21 [2022-07-13 18:11:54,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:11:55,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:11:55,095 INFO L356 Elim1Store]: treesize reduction 135, result has 0.7 percent of original size [2022-07-13 18:11:55,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 1 [2022-07-13 18:11:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 35 proven. 52 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 18:11:55,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:11:55,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746679692] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:55,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:11:55,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2022-07-13 18:11:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604462394] [2022-07-13 18:11:55,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:11:55,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 18:11:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:11:55,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 18:11:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 18:11:55,510 INFO L87 Difference]: Start difference. First operand 785 states and 1371 transitions. Second operand has 43 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 34 states have internal predecessors, (82), 16 states have call successors, (24), 8 states have call predecessors, (24), 14 states have return successors, (21), 18 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-13 18:11:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:11:58,024 INFO L93 Difference]: Finished difference Result 2002 states and 3971 transitions. [2022-07-13 18:11:58,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-13 18:11:58,027 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 34 states have internal predecessors, (82), 16 states have call successors, (24), 8 states have call predecessors, (24), 14 states have return successors, (21), 18 states have call predecessors, (21), 12 states have call successors, (21) Word has length 86 [2022-07-13 18:11:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:11:58,044 INFO L225 Difference]: With dead ends: 2002 [2022-07-13 18:11:58,045 INFO L226 Difference]: Without dead ends: 1881 [2022-07-13 18:11:58,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=490, Invalid=7700, Unknown=0, NotChecked=0, Total=8190 [2022-07-13 18:11:58,058 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 188 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 18:11:58,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 730 Invalid, 2364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1985 Invalid, 0 Unknown, 294 Unchecked, 0.9s Time] [2022-07-13 18:11:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2022-07-13 18:11:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1211. [2022-07-13 18:11:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 909 states have (on average 1.2541254125412542) internal successors, (1140), 889 states have internal predecessors, (1140), 111 states have call successors, (111), 65 states have call predecessors, (111), 190 states have return successors, (1168), 256 states have call predecessors, (1168), 76 states have call successors, (1168) [2022-07-13 18:11:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 2419 transitions. [2022-07-13 18:11:58,228 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 2419 transitions. Word has length 86 [2022-07-13 18:11:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:11:58,229 INFO L495 AbstractCegarLoop]: Abstraction has 1211 states and 2419 transitions. [2022-07-13 18:11:58,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 34 states have internal predecessors, (82), 16 states have call successors, (24), 8 states have call predecessors, (24), 14 states have return successors, (21), 18 states have call predecessors, (21), 12 states have call successors, (21) [2022-07-13 18:11:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 2419 transitions. [2022-07-13 18:11:58,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 18:11:58,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:11:58,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 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] [2022-07-13 18:11:58,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-13 18:11:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:58,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:11:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:11:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 181678716, now seen corresponding path program 4 times [2022-07-13 18:11:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:11:58,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336384356] [2022-07-13 18:11:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:11:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:11:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:11:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:11:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:11:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:11:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:59,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:11:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:11:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:11:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:11:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 18:11:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:11:59,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336384356] [2022-07-13 18:11:59,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336384356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:11:59,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087490570] [2022-07-13 18:11:59,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 18:11:59,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:11:59,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:11:59,123 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:11:59,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 18:11:59,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 18:11:59,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:11:59,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-13 18:11:59,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:11:59,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:11:59,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:11:59,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:11:59,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 62 [2022-07-13 18:11:59,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:11:59,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2022-07-13 18:12:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 18:12:00,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:00,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087490570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:00,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:12:00,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 39 [2022-07-13 18:12:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185333707] [2022-07-13 18:12:00,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:00,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 18:12:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:00,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 18:12:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1753, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 18:12:00,487 INFO L87 Difference]: Start difference. First operand 1211 states and 2419 transitions. Second operand has 39 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 15 states have call successors, (21), 10 states have call predecessors, (21), 11 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-13 18:12:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:02,854 INFO L93 Difference]: Finished difference Result 2924 states and 8092 transitions. [2022-07-13 18:12:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-13 18:12:02,855 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 15 states have call successors, (21), 10 states have call predecessors, (21), 11 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) Word has length 76 [2022-07-13 18:12:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:02,888 INFO L225 Difference]: With dead ends: 2924 [2022-07-13 18:12:02,888 INFO L226 Difference]: Without dead ends: 2911 [2022-07-13 18:12:02,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 125 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=515, Invalid=5805, Unknown=0, NotChecked=0, Total=6320 [2022-07-13 18:12:02,895 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 167 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:02,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 372 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1627 Invalid, 0 Unknown, 414 Unchecked, 0.8s Time] [2022-07-13 18:12:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2022-07-13 18:12:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2069. [2022-07-13 18:12:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1576 states have (on average 1.265228426395939) internal successors, (1994), 1521 states have internal predecessors, (1994), 153 states have call successors, (153), 91 states have call predecessors, (153), 339 states have return successors, (2779), 456 states have call predecessors, (2779), 106 states have call successors, (2779) [2022-07-13 18:12:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 4926 transitions. [2022-07-13 18:12:03,146 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 4926 transitions. Word has length 76 [2022-07-13 18:12:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:03,146 INFO L495 AbstractCegarLoop]: Abstraction has 2069 states and 4926 transitions. [2022-07-13 18:12:03,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 29 states have internal predecessors, (77), 15 states have call successors, (21), 10 states have call predecessors, (21), 11 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-13 18:12:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 4926 transitions. [2022-07-13 18:12:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 18:12:03,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:03,156 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 2, 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, 1, 1, 1] [2022-07-13 18:12:03,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:03,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:03,377 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 298042362, now seen corresponding path program 2 times [2022-07-13 18:12:03,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:03,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105413084] [2022-07-13 18:12:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:03,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 18:12:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:12:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-13 18:12:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:03,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105413084] [2022-07-13 18:12:03,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105413084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:03,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471515527] [2022-07-13 18:12:03,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 18:12:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:03,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:03,928 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:03,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 18:12:04,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 18:12:04,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:12:04,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 114 conjunts are in the unsatisfiable core [2022-07-13 18:12:04,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:04,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:12:04,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 18:12:04,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 18:12:04,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 18:12:04,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:12:04,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 18:12:04,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-13 18:12:04,301 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 18:12:04,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2022-07-13 18:12:04,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-13 18:12:05,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:12:05,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:12:05,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:12:05,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 37 [2022-07-13 18:12:05,097 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-13 18:12:05,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-13 18:12:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 33 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 18:12:05,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:05,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:12:05,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 18:12:05,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471515527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:05,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:12:05,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 35 [2022-07-13 18:12:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54780788] [2022-07-13 18:12:05,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:05,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-13 18:12:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:05,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-13 18:12:05,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-07-13 18:12:05,797 INFO L87 Difference]: Start difference. First operand 2069 states and 4926 transitions. Second operand has 35 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 24 states have internal predecessors, (67), 11 states have call successors, (22), 10 states have call predecessors, (22), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-13 18:12:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:06,984 INFO L93 Difference]: Finished difference Result 2366 states and 5490 transitions. [2022-07-13 18:12:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 18:12:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 24 states have internal predecessors, (67), 11 states have call successors, (22), 10 states have call predecessors, (22), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) Word has length 76 [2022-07-13 18:12:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:07,005 INFO L225 Difference]: With dead ends: 2366 [2022-07-13 18:12:07,005 INFO L226 Difference]: Without dead ends: 2329 [2022-07-13 18:12:07,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=300, Invalid=3732, Unknown=0, NotChecked=0, Total=4032 [2022-07-13 18:12:07,008 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:07,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 507 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 939 Invalid, 0 Unknown, 452 Unchecked, 0.5s Time] [2022-07-13 18:12:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2022-07-13 18:12:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2281. [2022-07-13 18:12:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 1734 states have (on average 1.2647058823529411) internal successors, (2193), 1669 states have internal predecessors, (2193), 176 states have call successors, (176), 103 states have call predecessors, (176), 370 states have return successors, (2986), 508 states have call predecessors, (2986), 127 states have call successors, (2986) [2022-07-13 18:12:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 5355 transitions. [2022-07-13 18:12:07,191 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 5355 transitions. Word has length 76 [2022-07-13 18:12:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:07,192 INFO L495 AbstractCegarLoop]: Abstraction has 2281 states and 5355 transitions. [2022-07-13 18:12:07,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 24 states have internal predecessors, (67), 11 states have call successors, (22), 10 states have call predecessors, (22), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-13 18:12:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 5355 transitions. [2022-07-13 18:12:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 18:12:07,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:07,201 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:07,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:07,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:07,423 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -535102576, now seen corresponding path program 3 times [2022-07-13 18:12:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:07,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428149574] [2022-07-13 18:12:07,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:07,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:12:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 18:12:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 23 proven. 100 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-13 18:12:09,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:09,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428149574] [2022-07-13 18:12:09,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428149574] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:09,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916720536] [2022-07-13 18:12:09,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:12:09,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:09,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:09,775 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:09,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 18:12:10,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 18:12:10,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:12:10,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-13 18:12:10,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:10,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:12:10,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:12:10,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:12:10,530 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base Int) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (and (= (select |c_old(#valid)| nondet_tree_~n~0.base) 0) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_2892)) (= (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_2891) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 18:12:10,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:12:10,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:12:10,679 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 18:12:10,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 27 [2022-07-13 18:12:10,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:12:10,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:12:10,695 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 18:12:10,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 27 [2022-07-13 18:12:10,711 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-13 18:12:10,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 34 [2022-07-13 18:12:10,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:12:10,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:12:11,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:12:11,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:12:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 181 trivial. 12 not checked. [2022-07-13 18:12:11,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:11,579 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 18:12:11,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 24 treesize of output 1 [2022-07-13 18:12:11,583 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 18:12:11,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 24 treesize of output 1 [2022-07-13 18:12:13,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916720536] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:13,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:12:13,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 38 [2022-07-13 18:12:13,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829601899] [2022-07-13 18:12:13,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:13,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 18:12:13,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:13,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 18:12:13,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1743, Unknown=8, NotChecked=84, Total=1980 [2022-07-13 18:12:13,640 INFO L87 Difference]: Start difference. First operand 2281 states and 5355 transitions. Second operand has 38 states, 32 states have (on average 2.4375) internal successors, (78), 27 states have internal predecessors, (78), 15 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2022-07-13 18:12:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:15,989 INFO L93 Difference]: Finished difference Result 3449 states and 8166 transitions. [2022-07-13 18:12:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-13 18:12:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.4375) internal successors, (78), 27 states have internal predecessors, (78), 15 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) Word has length 108 [2022-07-13 18:12:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:16,027 INFO L225 Difference]: With dead ends: 3449 [2022-07-13 18:12:16,027 INFO L226 Difference]: Without dead ends: 2991 [2022-07-13 18:12:16,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 197 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=428, Invalid=4248, Unknown=20, NotChecked=134, Total=4830 [2022-07-13 18:12:16,035 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 112 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:16,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 580 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 940 Invalid, 0 Unknown, 457 Unchecked, 0.7s Time] [2022-07-13 18:12:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2022-07-13 18:12:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2557. [2022-07-13 18:12:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 1945 states have (on average 1.2647814910025708) internal successors, (2460), 1877 states have internal predecessors, (2460), 189 states have call successors, (189), 105 states have call predecessors, (189), 422 states have return successors, (3301), 574 states have call predecessors, (3301), 141 states have call successors, (3301) [2022-07-13 18:12:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 5950 transitions. [2022-07-13 18:12:16,343 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 5950 transitions. Word has length 108 [2022-07-13 18:12:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:16,343 INFO L495 AbstractCegarLoop]: Abstraction has 2557 states and 5950 transitions. [2022-07-13 18:12:16,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.4375) internal successors, (78), 27 states have internal predecessors, (78), 15 states have call successors, (28), 9 states have call predecessors, (28), 12 states have return successors, (20), 16 states have call predecessors, (20), 13 states have call successors, (20) [2022-07-13 18:12:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 5950 transitions. [2022-07-13 18:12:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 18:12:16,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:16,356 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:16,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:16,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-13 18:12:16,583 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -560347655, now seen corresponding path program 5 times [2022-07-13 18:12:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:16,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665163179] [2022-07-13 18:12:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:12:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 55 proven. 68 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-13 18:12:17,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:17,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665163179] [2022-07-13 18:12:17,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665163179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860718319] [2022-07-13 18:12:17,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 18:12:17,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:17,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:17,793 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:17,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 18:12:18,440 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-13 18:12:18,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:12:18,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-13 18:12:18,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:18,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:12:19,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:12:19,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 65 [2022-07-13 18:12:19,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:12:19,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 48 [2022-07-13 18:12:19,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-13 18:12:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 19 proven. 67 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 18:12:19,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:20,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:12:20,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 65 treesize of output 68 [2022-07-13 18:12:23,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:12:23,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 56 [2022-07-13 18:12:25,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860718319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:25,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:12:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 28] total 61 [2022-07-13 18:12:25,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371554129] [2022-07-13 18:12:25,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:25,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-13 18:12:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-13 18:12:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5787, Unknown=0, NotChecked=0, Total=6006 [2022-07-13 18:12:25,807 INFO L87 Difference]: Start difference. First operand 2557 states and 5950 transitions. Second operand has 61 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 45 states have internal predecessors, (93), 20 states have call successors, (30), 8 states have call predecessors, (30), 13 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-13 18:12:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:12:34,193 INFO L93 Difference]: Finished difference Result 4697 states and 13325 transitions. [2022-07-13 18:12:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-07-13 18:12:34,194 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 45 states have internal predecessors, (93), 20 states have call successors, (30), 8 states have call predecessors, (30), 13 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) Word has length 99 [2022-07-13 18:12:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:12:34,249 INFO L225 Difference]: With dead ends: 4697 [2022-07-13 18:12:34,249 INFO L226 Difference]: Without dead ends: 4695 [2022-07-13 18:12:34,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4475 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1387, Invalid=21565, Unknown=0, NotChecked=0, Total=22952 [2022-07-13 18:12:34,257 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 207 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 5024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:12:34,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 579 Invalid, 5024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4173 Invalid, 0 Unknown, 726 Unchecked, 2.3s Time] [2022-07-13 18:12:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2022-07-13 18:12:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 2875. [2022-07-13 18:12:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2154 states have (on average 1.2595171773444753) internal successors, (2713), 2157 states have internal predecessors, (2713), 189 states have call successors, (189), 105 states have call predecessors, (189), 531 states have return successors, (4254), 612 states have call predecessors, (4254), 141 states have call successors, (4254) [2022-07-13 18:12:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 7156 transitions. [2022-07-13 18:12:34,681 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 7156 transitions. Word has length 99 [2022-07-13 18:12:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:12:34,681 INFO L495 AbstractCegarLoop]: Abstraction has 2875 states and 7156 transitions. [2022-07-13 18:12:34,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 45 states have internal predecessors, (93), 20 states have call successors, (30), 8 states have call predecessors, (30), 13 states have return successors, (23), 19 states have call predecessors, (23), 14 states have call successors, (23) [2022-07-13 18:12:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 7156 transitions. [2022-07-13 18:12:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 18:12:34,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:12:34,692 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:12:34,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 18:12:34,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-13 18:12:34,908 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:12:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:12:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1693624155, now seen corresponding path program 3 times [2022-07-13 18:12:34,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:12:34,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901879651] [2022-07-13 18:12:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:12:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:12:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:12:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:12:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:12:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:12:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:12:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:12:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:12:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 22 proven. 132 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-07-13 18:12:36,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:12:36,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901879651] [2022-07-13 18:12:36,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901879651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:12:36,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802782193] [2022-07-13 18:12:36,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 18:12:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:12:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:12:36,303 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:12:36,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 18:12:36,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-13 18:12:36,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:12:36,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-13 18:12:36,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:12:36,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:12:36,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:12:36,774 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-13 18:12:36,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-13 18:12:36,791 INFO L356 Elim1Store]: treesize reduction 31, result has 44.6 percent of original size [2022-07-13 18:12:36,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 25 treesize of output 36 [2022-07-13 18:12:42,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:12:42,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 66 [2022-07-13 18:12:42,581 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 18:12:42,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 37 [2022-07-13 18:12:42,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-07-13 18:12:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 58 proven. 38 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-13 18:12:42,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:12:45,619 INFO L356 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2022-07-13 18:12:45,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 47 [2022-07-13 18:12:45,957 INFO L356 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2022-07-13 18:12:45,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 47 [2022-07-13 18:12:48,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse2 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse3 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse2 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse2 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse3))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse0) (= .cse1 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse1 0) (= 0 .cse0)))))) is different from false [2022-07-13 18:12:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 56 proven. 27 refuted. 0 times theorem prover too weak. 156 trivial. 4 not checked. [2022-07-13 18:12:48,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802782193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:12:48,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:12:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25, 23] total 75 [2022-07-13 18:12:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702570526] [2022-07-13 18:12:48,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:12:48,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-13 18:12:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:12:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-13 18:12:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5176, Unknown=5, NotChecked=144, Total=5550 [2022-07-13 18:12:48,641 INFO L87 Difference]: Start difference. First operand 2875 states and 7156 transitions. Second operand has 75 states, 60 states have (on average 2.05) internal successors, (123), 55 states have internal predecessors, (123), 25 states have call successors, (37), 10 states have call predecessors, (37), 19 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2022-07-13 18:12:50,972 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| c_nondet_tree_~n~0.base)) (.cse0 (@diff |c_old(#valid)| |c_#valid|)) (.cse2 (+ 8 |c_nondet_tree_#res.offset|))) (and (= (select |c_old(#valid)| c_nondet_tree_~n~0.base) 0) (not (= c_nondet_tree_~n~0.base 0)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0)) (or (<= 1 |c_nondet_tree_#res.base|) (<= (+ |c_nondet_tree_#res.base| 1) 0)) (= |c_#valid| (store |c_old(#valid)| c_nondet_tree_~n~0.base .cse1)) (= .cse1 1) (= |c_#valid| (store |c_old(#valid)| .cse0 (select |c_#valid| .cse0))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| c_nondet_tree_~n~0.base (select |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base))) (or (not (<= c_nondet_tree_~n~0.base 0)) (<= (+ c_nondet_tree_~n~0.base 1) 0)) (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) .cse2) 0) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse5 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse6 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse5 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse6)) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse5 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse6))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse3) (= .cse4 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse4 0) (= 0 .cse3)))))) (= c_nondet_tree_~n~0.offset 0))) is different from false [2022-07-13 18:12:52,976 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|)) (.cse2 (+ 8 |c_nondet_tree_#res.offset|))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1))) (= (select |c_old(#valid)| .cse1) 0)))) (or (<= 1 |c_nondet_tree_#res.base|) (<= (+ |c_nondet_tree_#res.base| 1) 0)) (= |c_#valid| (store |c_old(#valid)| .cse0 (select |c_#valid| .cse0))) (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) .cse2) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) .cse2) 0) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse5 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse6 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse5 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse6)) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse5 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse6))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse3) (= .cse4 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse4 0) (= 0 .cse3)))))))) is different from false [2022-07-13 18:12:58,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| c_nondet_tree_~n~0.base))) (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| c_nondet_tree_~n~0.base .cse3))) (let ((.cse0 (@diff .cse1 |c_#memory_$Pointer$.base|))) (let ((.cse4 (store .cse1 .cse0 (select |c_#memory_$Pointer$.base| .cse0)))) (let ((.cse5 (@diff .cse4 |c_#memory_$Pointer$.base|))) (let ((.cse6 (store .cse4 .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse7 (@diff .cse6 |c_#memory_$Pointer$.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|)) (.cse8 (+ 8 |c_nondet_tree_#res.offset|))) (and (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$.base| .cse1)) (= 0 |c_nondet_tree_#res.offset|) (= (select |c_old(#valid)| c_nondet_tree_~n~0.base) 0) (not (= c_nondet_tree_~n~0.base 0)) (not (= (select .cse2 4) 0)) (not (= (select .cse3 (+ 4 c_nondet_tree_~n~0.offset)) 0)) (or (= |c_#memory_$Pointer$.base| .cse4) (= (select |c_old(#valid)| .cse5) 0)) (= (select |c_#valid| c_nondet_tree_~n~0.base) 1) (or (= |c_#memory_$Pointer$.base| .cse6) (= (select |c_old(#valid)| .cse7) 0)) (= |c_#memory_$Pointer$.base| (store .cse6 .cse7 (select |c_#memory_$Pointer$.base| .cse7))) (= (select .cse2 .cse8) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) .cse8) 0) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse11 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse12 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse11 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse12)) (.cse9 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse11 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse12))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse9) (= .cse10 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse10 0) (= 0 .cse9)))))) (= c_nondet_tree_~n~0.offset 0))))))))) is different from false [2022-07-13 18:13:00,546 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (let ((.cse9 (store |c_old(#memory_$Pointer$.base)| .cse1 (select |c_#memory_$Pointer$.base| .cse1)))) (let ((.cse8 (@diff .cse9 |c_#memory_$Pointer$.base|))) (let ((.cse4 (store .cse9 .cse8 (select |c_#memory_$Pointer$.base| .cse8)))) (let ((.cse5 (@diff .cse4 |c_#memory_$Pointer$.base|))) (let ((.cse12 (store .cse4 .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (let ((.cse11 (@diff .cse12 |c_#memory_$Pointer$.base|))) (let ((.cse7 (store .cse12 .cse11 (select |c_#memory_$Pointer$.base| .cse11)))) (let ((.cse6 (@diff .cse7 |c_#memory_$Pointer$.base|))) (let ((.cse2 (store .cse7 .cse6 (select |c_#memory_$Pointer$.base| .cse6)))) (let ((.cse3 (@diff .cse2 |c_#memory_$Pointer$.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|)) (.cse10 (+ 8 |c_nondet_tree_#res.offset|))) (and (= 0 |c_nondet_tree_#res.offset|) (not (= (select .cse0 4) 0)) (or (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= (select |c_old(#valid)| .cse1) 0)) (= |c_#memory_$Pointer$.base| (store .cse2 .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (or (= |c_#memory_$Pointer$.base| .cse4) (= (select |c_old(#valid)| .cse5) 0)) (or (= (select |c_old(#valid)| .cse3) 0) (= .cse2 |c_#memory_$Pointer$.base|)) (or (= (select |c_old(#valid)| .cse6) 0) (= |c_#memory_$Pointer$.base| .cse7)) (or (= (select |c_old(#valid)| .cse8) 0) (= |c_#memory_$Pointer$.base| .cse9)) (= (select .cse0 .cse10) 0) (or (= (select |c_old(#valid)| .cse11) 0) (= |c_#memory_$Pointer$.base| .cse12)) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) .cse10) 0) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse15 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse16 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse14 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse15 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse16)) (.cse13 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse15 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse16))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse13) (= .cse14 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse14 0) (= 0 .cse13)))))))))))))))))) is different from false [2022-07-13 18:13:03,437 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_nondet_tree_#res.offset|))) (and (not (= c_nondet_tree_~n~0.base 0)) (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) .cse0) 0) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse3 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse4 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse3 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse4)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse3 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse4))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse1) (= .cse2 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse2 0) (= 0 .cse1)))))) (= c_nondet_tree_~n~0.offset 0))) is different from false [2022-07-13 18:13:05,443 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_nondet_tree_#res.offset|))) (and (= (select (select |c_#memory_$Pointer$.base| |c_nondet_tree_#res.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_nondet_tree_#res.base|) .cse0) 0) (forall ((v_nondet_tree_~n~0.base_BEFORE_CALL_30 Int) (v_nondet_tree_~n~0.offset_BEFORE_CALL_50 Int)) (let ((.cse3 (+ v_nondet_tree_~n~0.offset_BEFORE_CALL_50 8)) (.cse4 (+ 8 |c_nondet_tree_#res.offset|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.base| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse3 |c_nondet_tree_#res.base|)) |c_nondet_tree_#res.base|) .cse4)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30 (store (select |c_#memory_$Pointer$.offset| v_nondet_tree_~n~0.base_BEFORE_CALL_30) .cse3 |c_nondet_tree_#res.offset|)) |c_nondet_tree_#res.base|) .cse4))) (or (and (= v_nondet_tree_~n~0.offset_BEFORE_CALL_50 .cse1) (= .cse2 v_nondet_tree_~n~0.base_BEFORE_CALL_30)) (and (= .cse2 0) (= 0 .cse1)))))))) is different from false [2022-07-13 18:13:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:11,103 INFO L93 Difference]: Finished difference Result 4645 states and 12101 transitions. [2022-07-13 18:13:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-07-13 18:13:11,108 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 60 states have (on average 2.05) internal successors, (123), 55 states have internal predecessors, (123), 25 states have call successors, (37), 10 states have call predecessors, (37), 19 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) Word has length 110 [2022-07-13 18:13:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:11,156 INFO L225 Difference]: With dead ends: 4645 [2022-07-13 18:13:11,156 INFO L226 Difference]: Without dead ends: 4599 [2022-07-13 18:13:11,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4879 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=947, Invalid=19374, Unknown=13, NotChecked=2016, Total=22350 [2022-07-13 18:13:11,163 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 134 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 4216 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 5625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 4216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1257 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:11,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1125 Invalid, 5625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 4216 Invalid, 0 Unknown, 1257 Unchecked, 2.6s Time] [2022-07-13 18:13:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2022-07-13 18:13:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 3611. [2022-07-13 18:13:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3611 states, 2713 states have (on average 1.2631772945079247) internal successors, (3427), 2727 states have internal predecessors, (3427), 216 states have call successors, (216), 124 states have call predecessors, (216), 681 states have return successors, (6362), 759 states have call predecessors, (6362), 157 states have call successors, (6362) [2022-07-13 18:13:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3611 states to 3611 states and 10005 transitions. [2022-07-13 18:13:11,661 INFO L78 Accepts]: Start accepts. Automaton has 3611 states and 10005 transitions. Word has length 110 [2022-07-13 18:13:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:11,662 INFO L495 AbstractCegarLoop]: Abstraction has 3611 states and 10005 transitions. [2022-07-13 18:13:11,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 60 states have (on average 2.05) internal successors, (123), 55 states have internal predecessors, (123), 25 states have call successors, (37), 10 states have call predecessors, (37), 19 states have return successors, (32), 23 states have call predecessors, (32), 18 states have call successors, (32) [2022-07-13 18:13:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3611 states and 10005 transitions. [2022-07-13 18:13:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 18:13:11,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:11,676 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:11,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-13 18:13:11,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:11,877 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -285986040, now seen corresponding path program 4 times [2022-07-13 18:13:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:11,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004138668] [2022-07-13 18:13:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:13:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:13:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:13:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:13:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:13:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:13:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:13:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:12,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 47 proven. 79 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 18:13:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004138668] [2022-07-13 18:13:13,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004138668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:13,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944569766] [2022-07-13 18:13:13,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 18:13:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:13,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:13,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:13,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 18:13:13,438 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 18:13:13,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 18:13:13,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-13 18:13:13,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:13,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:13:14,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:13:14,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 65 [2022-07-13 18:13:14,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:13:14,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 48 [2022-07-13 18:13:14,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-13 18:13:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 19 proven. 59 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-13 18:13:14,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:13:16,240 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:13:16,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 74 [2022-07-13 18:13:16,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 18:13:16,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 62 [2022-07-13 18:13:19,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944569766] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:19,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:13:19,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 29] total 66 [2022-07-13 18:13:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766792542] [2022-07-13 18:13:19,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 18:13:19,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-13 18:13:19,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:13:19,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-13 18:13:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=6911, Unknown=0, NotChecked=0, Total=7140 [2022-07-13 18:13:19,261 INFO L87 Difference]: Start difference. First operand 3611 states and 10005 transitions. Second operand has 66 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 47 states have internal predecessors, (93), 20 states have call successors, (28), 8 states have call predecessors, (28), 13 states have return successors, (24), 20 states have call predecessors, (24), 14 states have call successors, (24) [2022-07-13 18:13:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:13:29,830 INFO L93 Difference]: Finished difference Result 6134 states and 18945 transitions. [2022-07-13 18:13:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-07-13 18:13:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 47 states have internal predecessors, (93), 20 states have call successors, (28), 8 states have call predecessors, (28), 13 states have return successors, (24), 20 states have call predecessors, (24), 14 states have call successors, (24) Word has length 100 [2022-07-13 18:13:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:13:29,884 INFO L225 Difference]: With dead ends: 6134 [2022-07-13 18:13:29,885 INFO L226 Difference]: Without dead ends: 6132 [2022-07-13 18:13:29,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5673 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1535, Invalid=27877, Unknown=0, NotChecked=0, Total=29412 [2022-07-13 18:13:29,891 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 249 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 5371 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 6305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 5371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 771 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:13:29,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 656 Invalid, 6305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 5371 Invalid, 0 Unknown, 771 Unchecked, 2.8s Time] [2022-07-13 18:13:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2022-07-13 18:13:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 3712. [2022-07-13 18:13:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 2802 states have (on average 1.265524625267666) internal successors, (3546), 2801 states have internal predecessors, (3546), 213 states have call successors, (213), 122 states have call predecessors, (213), 696 states have return successors, (6621), 788 states have call predecessors, (6621), 157 states have call successors, (6621) [2022-07-13 18:13:30,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 10380 transitions. [2022-07-13 18:13:30,558 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 10380 transitions. Word has length 100 [2022-07-13 18:13:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:13:30,559 INFO L495 AbstractCegarLoop]: Abstraction has 3712 states and 10380 transitions. [2022-07-13 18:13:30,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 47 states have internal predecessors, (93), 20 states have call successors, (28), 8 states have call predecessors, (28), 13 states have return successors, (24), 20 states have call predecessors, (24), 14 states have call successors, (24) [2022-07-13 18:13:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 10380 transitions. [2022-07-13 18:13:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-13 18:13:30,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:13:30,571 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:13:30,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 18:13:30,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:30,793 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:13:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:13:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -746395746, now seen corresponding path program 1 times [2022-07-13 18:13:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:13:30,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544154067] [2022-07-13 18:13:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:13:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:13:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:13:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:13:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 18:13:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 18:13:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 18:13:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 18:13:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 18:13:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 18:13:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 18:13:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 18:13:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-13 18:13:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:13:33,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544154067] [2022-07-13 18:13:33,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544154067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:13:33,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589493225] [2022-07-13 18:13:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:13:33,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:13:33,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:13:33,562 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:13:33,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 18:13:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:13:33,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-13 18:13:33,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:13:33,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 18:13:33,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:13:33,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 18:13:34,119 WARN L855 $PredicateComparison]: unable to prove that (exists ((nondet_tree_~n~0.base Int) (v_ArrVal_4076 (Array Int Int)) (v_ArrVal_4077 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.offset)| nondet_tree_~n~0.base v_ArrVal_4077) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| nondet_tree_~n~0.base) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| nondet_tree_~n~0.base v_ArrVal_4076)))) is different from true [2022-07-13 18:13:34,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:13:34,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:13:34,352 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 18:13:34,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 27 [2022-07-13 18:13:34,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:13:34,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 18:13:34,369 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 18:13:34,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 27 [2022-07-13 18:13:34,389 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-13 18:13:34,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 29 treesize of output 34 [2022-07-13 18:13:34,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 18:13:34,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-07-13 18:13:34,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18