./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:22:46,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:22:46,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:22:46,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:22:46,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:22:46,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:22:46,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:22:46,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:22:46,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:22:46,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:22:46,828 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:22:46,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:22:46,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:22:46,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:22:46,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:22:46,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:22:46,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:22:46,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:22:46,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:22:46,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:22:46,845 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:22:46,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:22:46,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:22:46,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:22:46,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:22:46,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:22:46,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:22:46,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:22:46,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:22:46,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:22:46,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:22:46,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:22:46,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:22:46,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:22:46,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:22:46,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:22:46,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:22:46,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:22:46,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:22:46,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:22:46,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:22:46,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:22:46,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:22:46,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:22:46,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:22:46,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:22:46,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:22:46,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:22:46,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:22:46,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:22:46,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:22:46,901 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:22:46,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:22:46,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:22:46,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:22:46,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:22:46,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:22:46,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:22:46,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:22:46,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:22:46,903 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:22:46,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:22:46,904 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:22:46,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:22:46,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:22:46,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:22:46,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:22:46,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:46,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:22:46,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:22:46,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:22:46,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:22:46,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:22:46,906 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:22:46,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:22:46,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:22:46,907 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-19 14:22:47,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:22:47,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:22:47,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:22:47,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:22:47,213 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:22:47,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-19 14:22:47,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b76f98a/c2e074be112d434b9683fb92acf1c580/FLAG5136573d6 [2022-07-19 14:22:47,733 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:22:47,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-19 14:22:47,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b76f98a/c2e074be112d434b9683fb92acf1c580/FLAG5136573d6 [2022-07-19 14:22:48,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b76f98a/c2e074be112d434b9683fb92acf1c580 [2022-07-19 14:22:48,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:22:48,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:22:48,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:48,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:22:48,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:22:48,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7f1fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48, skipping insertion in model container [2022-07-19 14:22:48,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:22:48,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:22:48,309 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/heap-manipulation/dancing.i[938,951] [2022-07-19 14:22:48,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:48,469 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:22:48,485 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/heap-manipulation/dancing.i[938,951] [2022-07-19 14:22:48,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:22:48,537 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:22:48,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48 WrapperNode [2022-07-19 14:22:48,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:22:48,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:48,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:22:48,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:22:48,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,589 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-19 14:22:48,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:22:48,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:22:48,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:22:48,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:22:48,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:22:48,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:22:48,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:22:48,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:22:48,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (1/1) ... [2022-07-19 14:22:48,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:22:48,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:48,670 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-19 14:22:48,680 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-19 14:22:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-19 14:22:48,708 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-19 14:22:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 14:22:48,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 14:22:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:22:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:22:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 14:22:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:22:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:22:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:22:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:22:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:22:48,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:22:48,856 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:22:48,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:22:49,105 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:22:49,110 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:22:49,110 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:22:49,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:49 BoogieIcfgContainer [2022-07-19 14:22:49,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:22:49,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:22:49,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:22:49,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:22:49,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:22:48" (1/3) ... [2022-07-19 14:22:49,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2063a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:49, skipping insertion in model container [2022-07-19 14:22:49,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:22:48" (2/3) ... [2022-07-19 14:22:49,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2063a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:22:49, skipping insertion in model container [2022-07-19 14:22:49,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:22:49" (3/3) ... [2022-07-19 14:22:49,123 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-19 14:22:49,136 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:22:49,137 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:22:49,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:22:49,198 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@6e9a3c95, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a46bf24 [2022-07-19 14:22:49,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:22:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:22:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:22:49,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:49,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:49,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1472755522, now seen corresponding path program 1 times [2022-07-19 14:22:49,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:49,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021839693] [2022-07-19 14:22:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,471 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-19 14:22:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:49,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021839693] [2022-07-19 14:22:49,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021839693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:49,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:49,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:22:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876507984] [2022-07-19 14:22:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:22:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:49,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:22:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:22:49,508 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:22:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:49,529 INFO L93 Difference]: Finished difference Result 77 states and 107 transitions. [2022-07-19 14:22:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:22:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:22:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:49,537 INFO L225 Difference]: With dead ends: 77 [2022-07-19 14:22:49,538 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 14:22:49,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:22:49,547 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:49,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 14:22:49,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-19 14:22:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-19 14:22:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-07-19 14:22:49,586 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 20 [2022-07-19 14:22:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:49,586 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-07-19 14:22:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:22:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-07-19 14:22:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:22:49,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:49,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:49,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:22:49,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -751028367, now seen corresponding path program 1 times [2022-07-19 14:22:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710817526] [2022-07-19 14:22:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,767 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-19 14:22:49,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:49,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710817526] [2022-07-19 14:22:49,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710817526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:49,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:49,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405476486] [2022-07-19 14:22:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:49,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:49,773 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:22:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:49,841 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-19 14:22:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:22:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-19 14:22:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:49,853 INFO L225 Difference]: With dead ends: 45 [2022-07-19 14:22:49,853 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 14:22:49,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:49,855 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:49,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 14:22:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-07-19 14:22:49,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-19 14:22:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-07-19 14:22:49,864 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 20 [2022-07-19 14:22:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:49,866 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-07-19 14:22:49,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 14:22:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-07-19 14:22:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 14:22:49,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:49,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:49,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:22:49,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash 789210768, now seen corresponding path program 1 times [2022-07-19 14:22:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:49,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347601767] [2022-07-19 14:22:49,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:22:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:49,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347601767] [2022-07-19 14:22:49,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347601767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:49,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:49,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:22:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39951638] [2022-07-19 14:22:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:49,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:22:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:22:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:22:49,969 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:50,016 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-07-19 14:22:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-19 14:22:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:50,019 INFO L225 Difference]: With dead ends: 86 [2022-07-19 14:22:50,021 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 14:22:50,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:50,023 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:50,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 134 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 14:22:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-07-19 14:22:50,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.380952380952381) internal successors, (58), 44 states have internal predecessors, (58), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-07-19 14:22:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-07-19 14:22:50,055 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 26 [2022-07-19 14:22:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:50,055 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-07-19 14:22:50,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 14:22:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-07-19 14:22:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:22:50,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:50,057 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:50,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:22:50,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 860755832, now seen corresponding path program 1 times [2022-07-19 14:22:50,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:50,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454223005] [2022-07-19 14:22:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:50,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:22:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:50,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 14:22:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:22:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:50,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454223005] [2022-07-19 14:22:50,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454223005] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:50,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725080479] [2022-07-19 14:22:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:50,227 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-19 14:22:50,229 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-19 14:22:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:50,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:22:50,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:22:50,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:22:50,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725080479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:50,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:22:50,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-19 14:22:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704923686] [2022-07-19 14:22:50,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:50,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:22:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:22:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-19 14:22:50,565 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:22:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:50,842 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2022-07-19 14:22:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:22:50,842 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-07-19 14:22:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:50,850 INFO L225 Difference]: With dead ends: 118 [2022-07-19 14:22:50,850 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 14:22:50,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-19 14:22:50,860 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 132 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:50,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 338 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:22:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 14:22:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-07-19 14:22:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 52 states have internal predecessors, (66), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-19 14:22:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-07-19 14:22:50,879 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 29 [2022-07-19 14:22:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:50,880 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-07-19 14:22:50,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-19 14:22:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-07-19 14:22:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 14:22:50,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:50,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:50,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 14:22:51,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:51,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:51,084 INFO L85 PathProgramCache]: Analyzing trace with hash 162961828, now seen corresponding path program 1 times [2022-07-19 14:22:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:51,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104093994] [2022-07-19 14:22:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:22:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:22:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:22:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104093994] [2022-07-19 14:22:51,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104093994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:51,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:51,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:22:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403788881] [2022-07-19 14:22:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:51,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:22:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:22:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:51,209 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:22:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:51,280 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2022-07-19 14:22:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:22:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-19 14:22:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:51,281 INFO L225 Difference]: With dead ends: 75 [2022-07-19 14:22:51,281 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 14:22:51,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 14:22:51,285 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:51,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 289 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 14:22:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-07-19 14:22:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 58 states have internal predecessors, (71), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2022-07-19 14:22:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2022-07-19 14:22:51,313 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 31 [2022-07-19 14:22:51,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:51,313 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2022-07-19 14:22:51,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 14:22:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-07-19 14:22:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:22:51,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:51,315 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:51,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:22:51,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 786337177, now seen corresponding path program 1 times [2022-07-19 14:22:51,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:51,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171685925] [2022-07-19 14:22:51,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:51,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:22:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 14:22:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:22:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171685925] [2022-07-19 14:22:51,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171685925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:51,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307760888] [2022-07-19 14:22:51,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:51,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:51,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:51,435 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-19 14:22:51,436 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-19 14:22:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:51,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 14:22:51,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:51,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:51,699 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:22:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:51,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:22:51,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:51,733 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 16 treesize of output 18 [2022-07-19 14:22:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:51,746 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 16 treesize of output 18 [2022-07-19 14:22:51,918 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 7 [2022-07-19 14:22:51,922 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 7 [2022-07-19 14:22:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:22:51,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:52,000 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 10 treesize of output 4 [2022-07-19 14:22:52,140 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-19 14:22:52,141 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 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-19 14:22:52,146 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 36 treesize of output 24 [2022-07-19 14:22:52,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:22:52,160 INFO L356 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2022-07-19 14:22:52,161 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-19 14:22:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 14:22:52,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307760888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:52,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:22:52,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-07-19 14:22:52,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573932186] [2022-07-19 14:22:52,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:52,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 14:22:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 14:22:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-19 14:22:52,190 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 14:22:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:52,759 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2022-07-19 14:22:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 14:22:52,759 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 37 [2022-07-19 14:22:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:52,762 INFO L225 Difference]: With dead ends: 269 [2022-07-19 14:22:52,762 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 14:22:52,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-07-19 14:22:52,764 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 193 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:52,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 881 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 381 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2022-07-19 14:22:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 14:22:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 90. [2022-07-19 14:22:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 74 states have internal predecessors, (92), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-19 14:22:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2022-07-19 14:22:52,782 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 37 [2022-07-19 14:22:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:52,782 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2022-07-19 14:22:52,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 14:22:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2022-07-19 14:22:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:22:52,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:52,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:52,813 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-19 14:22:53,010 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,SelfDestructingSolverStorable5 [2022-07-19 14:22:53,010 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1693334873, now seen corresponding path program 1 times [2022-07-19 14:22:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:53,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624108658] [2022-07-19 14:22:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:22:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:22:53,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:53,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624108658] [2022-07-19 14:22:53,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624108658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:53,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:53,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:53,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634183087] [2022-07-19 14:22:53,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:53,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:53,124 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:53,225 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2022-07-19 14:22:53,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:53,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-07-19 14:22:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:53,227 INFO L225 Difference]: With dead ends: 133 [2022-07-19 14:22:53,227 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 14:22:53,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:53,230 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:53,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 165 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:22:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 14:22:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-19 14:22:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.323943661971831) internal successors, (94), 76 states have internal predecessors, (94), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2022-07-19 14:22:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2022-07-19 14:22:53,245 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 35 [2022-07-19 14:22:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:53,245 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2022-07-19 14:22:53,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:22:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2022-07-19 14:22:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 14:22:53,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:53,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:53,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 14:22:53,247 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1474480155, now seen corresponding path program 1 times [2022-07-19 14:22:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:53,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581814048] [2022-07-19 14:22:53,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:53,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:22:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 14:22:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:53,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581814048] [2022-07-19 14:22:53,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581814048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:53,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:53,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 14:22:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764845143] [2022-07-19 14:22:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:53,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:22:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:22:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:53,317 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:22:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:53,350 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-07-19 14:22:53,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:22:53,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-07-19 14:22:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:53,351 INFO L225 Difference]: With dead ends: 99 [2022-07-19 14:22:53,351 INFO L226 Difference]: Without dead ends: 92 [2022-07-19 14:22:53,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:22:53,352 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:53,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 237 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-19 14:22:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-19 14:22:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 66 states have internal predecessors, (84), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-19 14:22:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2022-07-19 14:22:53,362 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 35 [2022-07-19 14:22:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:53,362 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2022-07-19 14:22:53,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:22:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2022-07-19 14:22:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 14:22:53,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:53,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:22:53,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 14:22:53,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:53,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1846747895, now seen corresponding path program 1 times [2022-07-19 14:22:53,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:53,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44208397] [2022-07-19 14:22:53,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:53,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 14:22:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:22:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:22:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44208397] [2022-07-19 14:22:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44208397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:53,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:22:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066487563] [2022-07-19 14:22:53,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:53,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:22:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:22:53,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:22:53,436 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:22:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:53,497 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-07-19 14:22:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:22:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-19 14:22:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:53,499 INFO L225 Difference]: With dead ends: 130 [2022-07-19 14:22:53,499 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:22:53,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:22:53,500 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:53,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 144 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:22:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-07-19 14:22:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-19 14:22:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-07-19 14:22:53,507 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 36 [2022-07-19 14:22:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:53,508 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-07-19 14:22:53,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:22:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-07-19 14:22:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 14:22:53,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:53,509 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-19 14:22:53,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 14:22:53,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash -827934680, now seen corresponding path program 1 times [2022-07-19 14:22:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:53,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117680222] [2022-07-19 14:22:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:22:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 14:22:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:22:53,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:53,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117680222] [2022-07-19 14:22:53,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117680222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:53,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235774359] [2022-07-19 14:22:53,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:53,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:53,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:53,699 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-19 14:22:53,727 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-19 14:22:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:53,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 14:22:53,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:53,868 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-19 14:22:53,907 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:22:53,907 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-19 14:22:53,944 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-19 14:22:53,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-19 14:22:53,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-19 14:22:53,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-19 14:22:53,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:22:53,977 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 63 treesize of output 13 [2022-07-19 14:22:53,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:22:54,009 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse1 (select v_DerPreprocessor_3 .cse0))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse0) .cse1) (not (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse1)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse1) (select |c_#memory_$Pointer$.base| .cse1)))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (and (not (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from true [2022-07-19 14:22:54,029 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (and (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|))) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select v_DerPreprocessor_3 .cse1))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) .cse2) (not (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_3) .cse2) (select |c_#memory_$Pointer$.base| .cse2))))))) is different from true [2022-07-19 14:22:54,097 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4)) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|)) (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_1| 4))) (let ((.cse0 (select v_DerPreprocessor_3 .cse1))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3| v_DerPreprocessor_3) .cse0) (select |c_#memory_$Pointer$.base| .cse0)) (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_3|) .cse1))))))) is different from true [2022-07-19 14:22:54,411 INFO L356 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2022-07-19 14:22:54,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 87 [2022-07-19 14:22:54,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-19 14:22:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 3 not checked. [2022-07-19 14:22:54,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:22:54,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:22:54,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 127 [2022-07-19 14:22:54,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-07-19 14:22:54,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2022-07-19 14:22:54,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 14:22:54,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-19 14:22:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 14:22:54,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235774359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:22:54,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:22:54,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 25 [2022-07-19 14:22:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028195399] [2022-07-19 14:22:54,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:22:54,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 14:22:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 14:22:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=12, NotChecked=126, Total=600 [2022-07-19 14:22:54,767 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 25 states, 22 states have (on average 2.772727272727273) internal successors, (61), 24 states have internal predecessors, (61), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 14:22:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:55,348 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2022-07-19 14:22:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 14:22:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.772727272727273) internal successors, (61), 24 states have internal predecessors, (61), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 46 [2022-07-19 14:22:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:55,351 INFO L225 Difference]: With dead ends: 186 [2022-07-19 14:22:55,351 INFO L226 Difference]: Without dead ends: 145 [2022-07-19 14:22:55,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=775, Unknown=21, NotChecked=180, Total=1122 [2022-07-19 14:22:55,352 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 133 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 492 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:55,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 555 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 271 Invalid, 0 Unknown, 492 Unchecked, 0.3s Time] [2022-07-19 14:22:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-19 14:22:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 99. [2022-07-19 14:22:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 79 states have internal predecessors, (98), 15 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (27), 14 states have call predecessors, (27), 14 states have call successors, (27) [2022-07-19 14:22:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2022-07-19 14:22:55,396 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 46 [2022-07-19 14:22:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:55,396 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2022-07-19 14:22:55,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.772727272727273) internal successors, (61), 24 states have internal predecessors, (61), 7 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 14:22:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2022-07-19 14:22:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:22:55,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:55,398 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-07-19 14:22:55,427 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-19 14:22:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:55,612 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 828672736, now seen corresponding path program 1 times [2022-07-19 14:22:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:55,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978324929] [2022-07-19 14:22:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:22:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:22:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:22:55,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:55,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978324929] [2022-07-19 14:22:55,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978324929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:22:55,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:22:55,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 14:22:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411920166] [2022-07-19 14:22:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:22:55,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 14:22:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:22:55,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 14:22:55,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:22:55,716 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:22:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:22:55,774 INFO L93 Difference]: Finished difference Result 123 states and 175 transitions. [2022-07-19 14:22:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:22:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-19 14:22:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:22:55,775 INFO L225 Difference]: With dead ends: 123 [2022-07-19 14:22:55,775 INFO L226 Difference]: Without dead ends: 121 [2022-07-19 14:22:55,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 14:22:55,776 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 7 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:22:55,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 331 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:22:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-19 14:22:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2022-07-19 14:22:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 81 states have internal predecessors, (100), 15 states have call successors, (15), 5 states have call predecessors, (15), 10 states have return successors, (35), 15 states have call predecessors, (35), 14 states have call successors, (35) [2022-07-19 14:22:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2022-07-19 14:22:55,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 44 [2022-07-19 14:22:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:22:55,789 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2022-07-19 14:22:55,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 14:22:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2022-07-19 14:22:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 14:22:55,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:22:55,790 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 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-19 14:22:55,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 14:22:55,790 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:22:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:22:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 604583819, now seen corresponding path program 1 times [2022-07-19 14:22:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:22:55,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963817022] [2022-07-19 14:22:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:22:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:22:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:22:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:22:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 14:22:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:22:56,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963817022] [2022-07-19 14:22:56,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963817022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:22:56,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123488315] [2022-07-19 14:22:56,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:22:56,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:22:56,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:22:56,148 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-19 14:22:56,176 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-19 14:22:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:22:56,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-19 14:22:56,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:22:56,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:22:56,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,376 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 14 treesize of output 16 [2022-07-19 14:22:56,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:22:56,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,390 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 23 [2022-07-19 14:22:56,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:22:56,785 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 14:22:56,785 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 1 case distinctions, treesize of input 79 treesize of output 62 [2022-07-19 14:22:56,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:22:56,796 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2022-07-19 14:23:15,624 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:23:20,773 WARN L233 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:23:27,706 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:23:38,687 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:23:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 14:23:38,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:23:39,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123488315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:23:39,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:23:39,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 33 [2022-07-19 14:23:39,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136508888] [2022-07-19 14:23:39,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:23:39,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 14:23:39,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:23:39,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 14:23:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=994, Unknown=7, NotChecked=0, Total=1122 [2022-07-19 14:23:39,041 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 14:23:52,998 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:24:02,635 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 66 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:24:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:24:03,107 INFO L93 Difference]: Finished difference Result 279 states and 432 transitions. [2022-07-19 14:24:03,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-19 14:24:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 50 [2022-07-19 14:24:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:24:03,109 INFO L225 Difference]: With dead ends: 279 [2022-07-19 14:24:03,109 INFO L226 Difference]: Without dead ends: 228 [2022-07-19 14:24:03,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 65.3s TimeCoverageRelationStatistics Valid=402, Invalid=3006, Unknown=14, NotChecked=0, Total=3422 [2022-07-19 14:24:03,111 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 164 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 14:24:03,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 920 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 958 Invalid, 0 Unknown, 306 Unchecked, 0.8s Time] [2022-07-19 14:24:03,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-19 14:24:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 150. [2022-07-19 14:24:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 120 states have internal predecessors, (146), 22 states have call successors, (22), 7 states have call predecessors, (22), 15 states have return successors, (53), 22 states have call predecessors, (53), 21 states have call successors, (53) [2022-07-19 14:24:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 221 transitions. [2022-07-19 14:24:03,132 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 221 transitions. Word has length 50 [2022-07-19 14:24:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:24:03,132 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 221 transitions. [2022-07-19 14:24:03,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-19 14:24:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 221 transitions. [2022-07-19 14:24:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:24:03,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:24:03,134 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:24:03,161 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-19 14:24:03,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:03,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:24:03,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:24:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -13848694, now seen corresponding path program 1 times [2022-07-19 14:24:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:24:03,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463597206] [2022-07-19 14:24:03,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:03,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:24:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:24:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:03,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:03,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:24:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 14:24:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:24:03,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463597206] [2022-07-19 14:24:03,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463597206] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:24:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088664965] [2022-07-19 14:24:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:24:03,497 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-19 14:24:03,505 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-19 14:24:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:03,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 14:24:03,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:24:03,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:03,683 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:24:03,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:03,688 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 14 treesize of output 16 [2022-07-19 14:24:03,844 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 24 treesize of output 12 [2022-07-19 14:24:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 14:24:03,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:24:03,909 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 10 treesize of output 4 [2022-07-19 14:24:04,017 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-19 14:24:04,017 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-19 14:24:04,021 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 30 treesize of output 22 [2022-07-19 14:24:04,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-19 14:24:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 14:24:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088664965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:24:04,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:24:04,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-07-19 14:24:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629515820] [2022-07-19 14:24:04,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:24:04,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 14:24:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:24:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 14:24:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-07-19 14:24:04,080 INFO L87 Difference]: Start difference. First operand 150 states and 221 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 6 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-19 14:24:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:24:04,955 INFO L93 Difference]: Finished difference Result 301 states and 429 transitions. [2022-07-19 14:24:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 14:24:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 6 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) Word has length 43 [2022-07-19 14:24:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:24:04,957 INFO L225 Difference]: With dead ends: 301 [2022-07-19 14:24:04,957 INFO L226 Difference]: Without dead ends: 239 [2022-07-19 14:24:04,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=323, Invalid=1159, Unknown=0, NotChecked=0, Total=1482 [2022-07-19 14:24:04,958 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 190 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:24:04,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 879 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 559 Invalid, 0 Unknown, 62 Unchecked, 0.4s Time] [2022-07-19 14:24:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-19 14:24:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 197. [2022-07-19 14:24:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 151 states have (on average 1.2582781456953642) internal successors, (190), 156 states have internal predecessors, (190), 26 states have call successors, (26), 14 states have call predecessors, (26), 19 states have return successors, (52), 26 states have call predecessors, (52), 24 states have call successors, (52) [2022-07-19 14:24:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2022-07-19 14:24:04,979 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 43 [2022-07-19 14:24:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:24:04,979 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2022-07-19 14:24:04,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 states have internal predecessors, (60), 6 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-19 14:24:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2022-07-19 14:24:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 14:24:04,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:24:04,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:24:04,999 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-19 14:24:05,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-19 14:24:05,188 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:24:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:24:05,188 INFO L85 PathProgramCache]: Analyzing trace with hash 191887930, now seen corresponding path program 1 times [2022-07-19 14:24:05,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:24:05,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835070922] [2022-07-19 14:24:05,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:05,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:24:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:24:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 14:24:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 14:24:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:24:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835070922] [2022-07-19 14:24:05,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835070922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:24:05,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420884425] [2022-07-19 14:24:05,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:24:05,316 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-19 14:24:05,343 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-19 14:24:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:05,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-19 14:24:05,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:24:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:05,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:24:05,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,518 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 23 [2022-07-19 14:24:05,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:24:05,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,534 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 16 treesize of output 18 [2022-07-19 14:24:05,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,692 INFO L356 Elim1Store]: treesize reduction 59, result has 32.2 percent of original size [2022-07-19 14:24:05,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 94 [2022-07-19 14:24:05,707 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 10 treesize of output 9 [2022-07-19 14:24:05,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:05,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:05,746 INFO L356 Elim1Store]: treesize reduction 92, result has 24.6 percent of original size [2022-07-19 14:24:05,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 58 [2022-07-19 14:24:05,754 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 16 treesize of output 15 [2022-07-19 14:24:05,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-19 14:24:05,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:05,816 INFO L356 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2022-07-19 14:24:05,816 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 117 treesize of output 70 [2022-07-19 14:24:05,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2022-07-19 14:24:25,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:25,627 INFO L356 Elim1Store]: treesize reduction 8, result has 95.0 percent of original size [2022-07-19 14:24:25,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 275 treesize of output 371 [2022-07-19 14:24:25,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:25,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:24:25,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:25,849 INFO L356 Elim1Store]: treesize reduction 114, result has 59.4 percent of original size [2022-07-19 14:24:25,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 3 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 63 case distinctions, treesize of input 410 treesize of output 500 [2022-07-19 14:24:25,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:24:25,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-19 14:24:27,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-19 14:24:27,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:24:27,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:24:27,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:27,444 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2022-07-19 14:24:27,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:24:27,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-19 14:24:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:24:27,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:24:27,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 10 treesize of output 4 [2022-07-19 14:24:28,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4) 0)))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |c_ULTIMATE.start_main_~n~0#1.offset|)))) (.cse0 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |ULTIMATE.start_main_~n~0#1.base|)))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (= (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|))))))) is different from false [2022-07-19 14:24:28,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.base|))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 0))))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (= (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 0) (= (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 0))))))) is different from false [2022-07-19 14:24:28,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_16| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_16|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 0)))) (.cse2 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_931) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_935) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse4 |v_ULTIMATE.start_main_~n~0#1.base_16|)))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) |c_ULTIMATE.start_main_~n~0#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (= (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) 0) (= (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) 0))))))) is different from false [2022-07-19 14:24:28,658 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-19 14:24:28,658 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 2 case distinctions, treesize of input 327 treesize of output 293 [2022-07-19 14:24:28,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:28,683 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 2591 treesize of output 2516 [2022-07-19 14:24:28,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:28,784 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 2189 treesize of output 2085 [2022-07-19 14:24:28,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:28,809 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 2517 treesize of output 2417 [2022-07-19 14:24:28,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:28,832 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 2405 treesize of output 2317 [2022-07-19 14:24:28,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:28,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:28,860 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 2305 treesize of output 2219 [2022-07-19 14:24:28,941 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:28,943 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 13349 treesize of output 13057 [2022-07-19 14:24:29,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:24:29,080 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 67083 treesize of output 64359 [2022-07-19 14:24:49,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:24:49,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-07-19 14:24:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 4 not checked. [2022-07-19 14:24:49,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420884425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:24:49,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:24:49,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 15] total 32 [2022-07-19 14:24:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66742405] [2022-07-19 14:24:49,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:24:49,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 14:24:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:24:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 14:24:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=720, Unknown=13, NotChecked=168, Total=992 [2022-07-19 14:24:49,799 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 32 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-19 14:24:49,868 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (= (select .cse0 .cse1) 0) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_16| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_16|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 0)))) (.cse4 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_931) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_935) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |v_ULTIMATE.start_main_~n~0#1.base_16|)))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3)) (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~n~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (= (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse5) 0) (= (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse5) 0))))))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| 0) (< (+ 1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.offset| (select .cse0 |c_ULTIMATE.start_main_~n~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) 0))) is different from false [2022-07-19 14:24:49,874 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~tail~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) (.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) 0 |c_ULTIMATE.start_main_~tail~0#1.offset|) 4 0)))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0))))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3)) (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (= (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0) (= (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse5) 0))))))) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (< (+ 1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse1 .cse0) 0) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) is different from false [2022-07-19 14:24:49,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~tail~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (< (+ 1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_935 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4) 0)))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |c_ULTIMATE.start_main_~n~0#1.offset|)))) (.cse2 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_~tail~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_935) |c_ULTIMATE.start_main_~tail~0#1.base|) .cse6 |ULTIMATE.start_main_~n~0#1.base|)))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (= (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 0) (= (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) .cse3) 0))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5) |c_ULTIMATE.start_main_~x~0#1.base|))))))) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse1 .cse0) 0) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~n~0#1.offset| 0))) is different from false [2022-07-19 14:24:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:24:50,580 INFO L93 Difference]: Finished difference Result 320 states and 439 transitions. [2022-07-19 14:24:50,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 14:24:50,581 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 47 [2022-07-19 14:24:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:24:50,582 INFO L225 Difference]: With dead ends: 320 [2022-07-19 14:24:50,582 INFO L226 Difference]: Without dead ends: 166 [2022-07-19 14:24:50,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=202, Invalid=1612, Unknown=16, NotChecked=522, Total=2352 [2022-07-19 14:24:50,584 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 22 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:24:50,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 630 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 214 Unchecked, 0.1s Time] [2022-07-19 14:24:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-19 14:24:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 144. [2022-07-19 14:24:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.2545454545454546) internal successors, (138), 112 states have internal predecessors, (138), 18 states have call successors, (18), 14 states have call predecessors, (18), 15 states have return successors, (31), 17 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-19 14:24:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2022-07-19 14:24:50,602 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 47 [2022-07-19 14:24:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:24:50,602 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2022-07-19 14:24:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.5) internal successors, (75), 29 states have internal predecessors, (75), 6 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-19 14:24:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2022-07-19 14:24:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 14:24:50,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:24:50,604 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:24:50,623 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-19 14:24:50,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:50,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:24:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:24:50,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1865771786, now seen corresponding path program 1 times [2022-07-19 14:24:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:24:50,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930194038] [2022-07-19 14:24:50,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:24:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:50,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:24:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:24:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 14:24:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 14:24:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:24:50,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930194038] [2022-07-19 14:24:50,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930194038] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:24:50,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029912755] [2022-07-19 14:24:50,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:50,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:24:50,892 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-19 14:24:50,894 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-19 14:24:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:51,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:24:51,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:24:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:24:51,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:24:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 14:24:51,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029912755] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:24:51,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:24:51,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-19 14:24:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478498899] [2022-07-19 14:24:51,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:24:51,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:24:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:24:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:24:51,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-19 14:24:51,106 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 14:24:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:24:51,266 INFO L93 Difference]: Finished difference Result 197 states and 251 transitions. [2022-07-19 14:24:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 14:24:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 46 [2022-07-19 14:24:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:24:51,268 INFO L225 Difference]: With dead ends: 197 [2022-07-19 14:24:51,268 INFO L226 Difference]: Without dead ends: 147 [2022-07-19 14:24:51,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-07-19 14:24:51,269 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 133 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:24:51,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 165 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:24:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-19 14:24:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 142. [2022-07-19 14:24:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 111 states have internal predecessors, (132), 18 states have call successors, (18), 13 states have call predecessors, (18), 15 states have return successors, (31), 17 states have call predecessors, (31), 16 states have call successors, (31) [2022-07-19 14:24:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions. [2022-07-19 14:24:51,284 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 46 [2022-07-19 14:24:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:24:51,285 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 181 transitions. [2022-07-19 14:24:51,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-19 14:24:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions. [2022-07-19 14:24:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:24:51,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:24:51,286 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-07-19 14:24:51,304 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-19 14:24:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:51,492 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:24:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:24:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1248112818, now seen corresponding path program 2 times [2022-07-19 14:24:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:24:51,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754579981] [2022-07-19 14:24:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:24:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:24:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 14:24:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:51,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 14:24:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:51,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:24:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:24:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 14:24:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:24:51,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754579981] [2022-07-19 14:24:51,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754579981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:24:51,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817741577] [2022-07-19 14:24:51,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:24:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:24:51,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:24:51,949 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-19 14:24:51,979 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-19 14:24:52,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:24:52,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:24:52,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-19 14:24:52,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:24:52,119 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-19 14:24:52,165 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:24:52,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 14:24:52,186 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:24:52,186 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-19 14:24:52,227 INFO L356 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-07-19 14:24:52,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 78 [2022-07-19 14:24:52,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-19 14:24:52,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-19 14:24:52,247 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 82 treesize of output 25 [2022-07-19 14:24:52,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 14:24:52,269 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select v_DerPreprocessor_8 .cse1))) (and (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_8) .cse0 v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_8) .cse0) v_DerPreprocessor_7) (not (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) .cse0))))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)))) (and (not (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|))))) is different from true [2022-07-19 14:24:52,300 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_7| Int) (v_DerPreprocessor_7 (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11| Int) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse1 (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_7| 4))) (let ((.cse0 (select v_DerPreprocessor_8 .cse1))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11|) .cse1)) (= (select (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_8) .cse0 v_DerPreprocessor_7) |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_8) .cse0) v_DerPreprocessor_7))))) (exists ((|v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11| Int)) (not (= |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_main_~#list~0#1.offset_BEFORE_CALL_7| 4)))))) is different from true [2022-07-19 14:25:02,554 INFO L356 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-07-19 14:25:02,555 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 64 [2022-07-19 14:25:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-07-19 14:25:02,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:25:02,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:25:02,866 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 124 treesize of output 127 [2022-07-19 14:25:02,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-07-19 14:25:02,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2022-07-19 14:25:02,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-19 14:25:02,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-19 14:25:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 14:25:03,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817741577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:25:03,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:25:03,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 34 [2022-07-19 14:25:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623659479] [2022-07-19 14:25:03,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:25:03,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 14:25:03,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:25:03,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 14:25:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=886, Unknown=15, NotChecked=122, Total=1122 [2022-07-19 14:25:03,153 INFO L87 Difference]: Start difference. First operand 142 states and 181 transitions. Second operand has 34 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 7 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 14:25:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:25:09,024 INFO L93 Difference]: Finished difference Result 315 states and 427 transitions. [2022-07-19 14:25:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 14:25:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 7 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2022-07-19 14:25:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:25:09,026 INFO L225 Difference]: With dead ends: 315 [2022-07-19 14:25:09,026 INFO L226 Difference]: Without dead ends: 247 [2022-07-19 14:25:09,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=441, Invalid=2856, Unknown=17, NotChecked=226, Total=3540 [2022-07-19 14:25:09,028 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 279 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:25:09,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 1045 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1172 Invalid, 0 Unknown, 707 Unchecked, 0.7s Time] [2022-07-19 14:25:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-19 14:25:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 153. [2022-07-19 14:25:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 118 states have internal predecessors, (136), 20 states have call successors, (20), 15 states have call predecessors, (20), 18 states have return successors, (35), 19 states have call predecessors, (35), 18 states have call successors, (35) [2022-07-19 14:25:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2022-07-19 14:25:09,049 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 49 [2022-07-19 14:25:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:25:09,049 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2022-07-19 14:25:09,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.59375) internal successors, (83), 32 states have internal predecessors, (83), 7 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 14:25:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2022-07-19 14:25:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 14:25:09,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:25:09,050 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-07-19 14:25:09,077 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-19 14:25:09,275 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,SelfDestructingSolverStorable15 [2022-07-19 14:25:09,275 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:25:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:25:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash 201144634, now seen corresponding path program 1 times [2022-07-19 14:25:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:25:09,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535301335] [2022-07-19 14:25:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:25:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 14:25:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 14:25:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-19 14:25:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:25:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535301335] [2022-07-19 14:25:09,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535301335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:25:09,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:25:09,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:25:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124238053] [2022-07-19 14:25:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:25:09,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:25:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:25:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:25:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:25:09,328 INFO L87 Difference]: Start difference. First operand 153 states and 191 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:25:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:25:09,349 INFO L93 Difference]: Finished difference Result 248 states and 306 transitions. [2022-07-19 14:25:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:25:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-19 14:25:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:25:09,351 INFO L225 Difference]: With dead ends: 248 [2022-07-19 14:25:09,351 INFO L226 Difference]: Without dead ends: 138 [2022-07-19 14:25:09,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:25:09,352 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:25:09,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:25:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-19 14:25:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2022-07-19 14:25:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 105 states have internal predecessors, (120), 17 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (29), 17 states have call predecessors, (29), 15 states have call successors, (29) [2022-07-19 14:25:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2022-07-19 14:25:09,370 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 50 [2022-07-19 14:25:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:25:09,370 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2022-07-19 14:25:09,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 14:25:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2022-07-19 14:25:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 14:25:09,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:25:09,371 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:25:09,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 14:25:09,371 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:25:09,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:25:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash -664222695, now seen corresponding path program 1 times [2022-07-19 14:25:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:25:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349352271] [2022-07-19 14:25:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:25:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:25:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:25:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 14:25:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 14:25:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:25:09,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:25:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349352271] [2022-07-19 14:25:09,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349352271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:09,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951203028] [2022-07-19 14:25:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:09,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:25:09,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:25:09,716 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-19 14:25:09,720 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-19 14:25:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:09,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-19 14:25:09,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:25:09,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:09,936 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:09,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:09,940 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:09,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:09,944 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 23 [2022-07-19 14:25:09,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:09,947 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 16 treesize of output 18 [2022-07-19 14:25:10,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:10,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:25:10,274 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 14:25:10,275 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 1 case distinctions, treesize of input 72 treesize of output 59 [2022-07-19 14:25:10,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:10,295 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-19 14:25:10,296 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 3 case distinctions, treesize of input 88 treesize of output 71 [2022-07-19 14:25:10,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:10,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:10,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:25:10,641 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:25:10,641 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 2 case distinctions, treesize of input 67 treesize of output 26 [2022-07-19 14:25:10,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:10,647 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-07-19 14:25:10,647 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 39 treesize of output 18 [2022-07-19 14:25:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:25:10,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:25:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 14:25:10,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951203028] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:10,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:25:10,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13, 12] total 27 [2022-07-19 14:25:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620557429] [2022-07-19 14:25:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:25:10,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:25:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:25:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:25:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2022-07-19 14:25:10,824 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 14:25:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:25:10,991 INFO L93 Difference]: Finished difference Result 189 states and 241 transitions. [2022-07-19 14:25:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:25:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2022-07-19 14:25:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:25:10,993 INFO L225 Difference]: With dead ends: 189 [2022-07-19 14:25:10,993 INFO L226 Difference]: Without dead ends: 155 [2022-07-19 14:25:10,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2022-07-19 14:25:10,994 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:25:10,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 182 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:25:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-19 14:25:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2022-07-19 14:25:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 106 states have (on average 1.150943396226415) internal successors, (122), 107 states have internal predecessors, (122), 18 states have call successors, (18), 13 states have call predecessors, (18), 15 states have return successors, (30), 19 states have call predecessors, (30), 16 states have call successors, (30) [2022-07-19 14:25:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2022-07-19 14:25:11,036 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 53 [2022-07-19 14:25:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:25:11,036 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2022-07-19 14:25:11,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 14:25:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2022-07-19 14:25:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 14:25:11,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:25:11,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:25:11,059 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-19 14:25:11,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 14:25:11,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:25:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:25:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1675339945, now seen corresponding path program 1 times [2022-07-19 14:25:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:25:11,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752465613] [2022-07-19 14:25:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:25:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:25:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:25:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 14:25:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 14:25:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 14:25:11,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:25:11,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752465613] [2022-07-19 14:25:11,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752465613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:11,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212565372] [2022-07-19 14:25:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:11,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:25:11,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:25:11,531 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-19 14:25:11,533 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-19 14:25:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:11,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-19 14:25:11,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:25:11,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:11,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:11,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:11,760 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 23 treesize of output 23 [2022-07-19 14:25:11,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:11,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:11,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:11,784 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 23 treesize of output 23 [2022-07-19 14:25:12,175 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:25:12,175 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-07-19 14:25:12,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:12,179 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 44 treesize of output 42 [2022-07-19 14:25:12,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:12,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:12,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:25:12,687 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-19 14:25:12,688 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 43 [2022-07-19 14:25:12,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:12,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 16 [2022-07-19 14:25:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:25:12,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:25:20,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212565372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:20,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:25:20,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 31 [2022-07-19 14:25:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627105398] [2022-07-19 14:25:20,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:25:20,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 14:25:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:25:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 14:25:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1469, Unknown=5, NotChecked=0, Total=1640 [2022-07-19 14:25:20,462 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-19 14:25:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:25:21,471 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2022-07-19 14:25:21,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 14:25:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 53 [2022-07-19 14:25:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:25:21,472 INFO L225 Difference]: With dead ends: 182 [2022-07-19 14:25:21,472 INFO L226 Difference]: Without dead ends: 170 [2022-07-19 14:25:21,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=394, Invalid=2793, Unknown=5, NotChecked=0, Total=3192 [2022-07-19 14:25:21,474 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 101 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:25:21,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 490 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 407 Invalid, 0 Unknown, 208 Unchecked, 0.4s Time] [2022-07-19 14:25:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-19 14:25:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2022-07-19 14:25:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 120 states have (on average 1.15) internal successors, (138), 124 states have internal predecessors, (138), 21 states have call successors, (21), 15 states have call predecessors, (21), 17 states have return successors, (36), 19 states have call predecessors, (36), 19 states have call successors, (36) [2022-07-19 14:25:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2022-07-19 14:25:21,495 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 53 [2022-07-19 14:25:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:25:21,495 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2022-07-19 14:25:21,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 30 states have internal predecessors, (73), 9 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-19 14:25:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2022-07-19 14:25:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 14:25:21,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:25:21,496 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:25:21,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 14:25:21,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:25:21,715 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:25:21,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:25:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1417174507, now seen corresponding path program 1 times [2022-07-19 14:25:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:25:21,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648244142] [2022-07-19 14:25:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:25:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:25:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:21,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:25:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 14:25:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 14:25:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-19 14:25:21,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:25:21,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648244142] [2022-07-19 14:25:21,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648244142] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:21,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431628395] [2022-07-19 14:25:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:21,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:25:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:25:21,844 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-19 14:25:21,845 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-19 14:25:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:22,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-19 14:25:22,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:25:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:22,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:22,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:22,073 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 23 [2022-07-19 14:25:22,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:22,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:22,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:22,083 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 23 [2022-07-19 14:25:22,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:22,371 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-07-19 14:25:22,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:25:22,417 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-07-19 14:25:22,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:22,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:25:22,658 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-07-19 14:25:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:25:22,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:25:22,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431628395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:22,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:25:22,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2022-07-19 14:25:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747644128] [2022-07-19 14:25:22,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:25:22,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:25:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:25:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:25:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-07-19 14:25:22,841 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 14:25:23,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:25:23,352 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2022-07-19 14:25:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 14:25:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 53 [2022-07-19 14:25:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:25:23,354 INFO L225 Difference]: With dead ends: 184 [2022-07-19 14:25:23,354 INFO L226 Difference]: Without dead ends: 133 [2022-07-19 14:25:23,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2022-07-19 14:25:23,355 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:25:23,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 342 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 190 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2022-07-19 14:25:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-19 14:25:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2022-07-19 14:25:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 61 states have internal predecessors, (68), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-19 14:25:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-19 14:25:23,368 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 53 [2022-07-19 14:25:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:25:23,369 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-19 14:25:23,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 7 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-19 14:25:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-19 14:25:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 14:25:23,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:25:23,370 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:25:23,387 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-19 14:25:23,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:25:23,572 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:25:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:25:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -160259518, now seen corresponding path program 2 times [2022-07-19 14:25:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:25:23,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721532735] [2022-07-19 14:25:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:23,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:25:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:25:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:25:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 14:25:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 14:25:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 14:25:23,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:25:23,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721532735] [2022-07-19 14:25:23,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721532735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:25:23,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:25:23,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:25:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421352741] [2022-07-19 14:25:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:25:23,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:25:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:25:23,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:25:23,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:25:23,663 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 14:25:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:25:23,698 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-07-19 14:25:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:25:23,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 59 [2022-07-19 14:25:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:25:23,699 INFO L225 Difference]: With dead ends: 89 [2022-07-19 14:25:23,699 INFO L226 Difference]: Without dead ends: 79 [2022-07-19 14:25:23,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 14:25:23,700 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:25:23,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:25:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-19 14:25:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-19 14:25:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 9 states have call successors, (9), 9 states have call predecessors, (9), 9 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-19 14:25:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-07-19 14:25:23,711 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 59 [2022-07-19 14:25:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:25:23,711 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-07-19 14:25:23,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 14:25:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-07-19 14:25:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 14:25:23,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:25:23,712 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:25:23,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 14:25:23,712 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:25:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:25:23,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1055504788, now seen corresponding path program 3 times [2022-07-19 14:25:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:25:23,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711472758] [2022-07-19 14:25:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:25:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:25:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 14:25:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 14:25:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 14:25:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 14:25:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:25:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:25:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 14:25:24,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:25:24,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711472758] [2022-07-19 14:25:24,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711472758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:25:24,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637930324] [2022-07-19 14:25:24,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:25:24,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:25:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:25:24,064 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-19 14:25:24,093 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-19 14:25:24,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 14:25:24,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:25:24,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-19 14:25:24,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:25:24,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:24,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 14:25:24,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:24,398 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 23 [2022-07-19 14:25:24,614 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-19 14:25:24,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:24,630 INFO L356 Elim1Store]: treesize reduction 50, result has 29.6 percent of original size [2022-07-19 14:25:24,630 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 34 treesize of output 39 [2022-07-19 14:25:25,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:25,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:25,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:25:25,040 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:25:25,040 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2022-07-19 14:25:25,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:25:25,056 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-07-19 14:25:25,056 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 59 treesize of output 52 [2022-07-19 14:25:41,873 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:25:47,993 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:25:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 14:25:48,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:25:48,883 INFO L356 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2022-07-19 14:25:48,883 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 180 treesize of output 1 [2022-07-19 14:26:52,078 INFO L356 Elim1Store]: treesize reduction 8, result has 81.0 percent of original size [2022-07-19 14:26:52,079 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 163 [2022-07-19 14:26:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-19 14:26:52,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637930324] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:26:52,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:26:52,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25, 14] total 49 [2022-07-19 14:26:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86474187] [2022-07-19 14:26:52,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:26:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 14:26:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:26:52,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 14:26:52,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2115, Unknown=36, NotChecked=0, Total=2352 [2022-07-19 14:26:52,526 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 49 states, 46 states have (on average 2.4347826086956523) internal successors, (112), 46 states have internal predecessors, (112), 15 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (17), 11 states have call predecessors, (17), 14 states have call successors, (17)