./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms4.c --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/array-fpi/ms4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:34:50,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:34:50,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:34:50,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:34:50,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:34:50,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:34:50,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:34:50,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:34:50,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:34:50,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:34:50,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:34:50,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:34:50,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:34:50,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:34:50,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:34:50,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:34:50,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:34:50,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:34:50,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:34:50,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:34:50,887 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:34:50,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:34:50,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:34:50,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:34:50,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:34:50,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:34:50,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:34:50,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:34:50,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:34:50,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:34:50,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:34:50,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:34:50,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:34:50,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:34:50,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:34:50,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:34:50,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:34:50,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:34:50,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:34:50,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:34:50,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:34:50,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:34:50,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:34:50,937 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:34:50,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:34:50,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:34:50,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:34:50,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:34:50,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:34:50,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:34:50,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:34:50,940 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:34:50,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:34:50,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:34:50,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:34:50,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:34:50,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:34:50,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:34:50,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:34:50,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:34:50,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:34:50,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:34:50,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:34:50,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:34:50,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:34:50,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:34:50,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:34:50,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:34:50,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:34:50,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:34:50,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:34:50,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:34:50,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:34:50,945 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:34:50,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:34:50,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:34:50,946 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 -> 83260f11871b199c66fbefacd24c95d84ae219136106a5a3246a879f7c60a3e2 [2022-07-19 10:34:51,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:34:51,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:34:51,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:34:51,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:34:51,205 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:34:51,206 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms4.c [2022-07-19 10:34:51,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c522bfbde/77c444e488b744ceae088af83afb2f03/FLAG5c9a5c02a [2022-07-19 10:34:51,619 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:34:51,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms4.c [2022-07-19 10:34:51,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c522bfbde/77c444e488b744ceae088af83afb2f03/FLAG5c9a5c02a [2022-07-19 10:34:51,643 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c522bfbde/77c444e488b744ceae088af83afb2f03 [2022-07-19 10:34:51,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:34:51,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:34:51,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:34:51,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:34:51,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:34:51,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff002e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51, skipping insertion in model container [2022-07-19 10:34:51,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:34:51,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:34:51,818 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/array-fpi/ms4.c[586,599] [2022-07-19 10:34:51,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:34:51,843 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:34:51,853 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/array-fpi/ms4.c[586,599] [2022-07-19 10:34:51,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:34:51,869 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:34:51,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51 WrapperNode [2022-07-19 10:34:51,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:34:51,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:34:51,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:34:51,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:34:51,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,903 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2022-07-19 10:34:51,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:34:51,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:34:51,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:34:51,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:34:51,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:34:51,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:34:51,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:34:51,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:34:51,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (1/1) ... [2022-07-19 10:34:51,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:34:51,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:51,952 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 10:34:51,972 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 10:34:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:34:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:34:51,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:34:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:34:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:34:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:34:51,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:34:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:34:51,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:34:52,056 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:34:52,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:34:52,157 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:34:52,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:34:52,162 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:34:52,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:34:52 BoogieIcfgContainer [2022-07-19 10:34:52,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:34:52,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:34:52,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:34:52,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:34:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:34:51" (1/3) ... [2022-07-19 10:34:52,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d5de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:34:52, skipping insertion in model container [2022-07-19 10:34:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:34:51" (2/3) ... [2022-07-19 10:34:52,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d5de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:34:52, skipping insertion in model container [2022-07-19 10:34:52,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:34:52" (3/3) ... [2022-07-19 10:34:52,171 INFO L111 eAbstractionObserver]: Analyzing ICFG ms4.c [2022-07-19 10:34:52,182 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:34:52,182 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:34:52,219 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:34:52,225 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@185fdcf4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43ecd8db [2022-07-19 10:34:52,225 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:34:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:34:52,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:52,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:52,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-07-19 10:34:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:52,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005912090] [2022-07-19 10:34:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:52,379 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 10:34:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:52,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005912090] [2022-07-19 10:34:52,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005912090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:34:52,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:34:52,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:34:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034871563] [2022-07-19 10:34:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:34:52,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:34:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:52,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:34:52,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:34:52,418 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:52,430 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-07-19 10:34:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:34:52,432 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 10:34:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:52,442 INFO L225 Difference]: With dead ends: 34 [2022-07-19 10:34:52,443 INFO L226 Difference]: Without dead ends: 15 [2022-07-19 10:34:52,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:34:52,458 INFO L413 NwaCegarLoop]: 22 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, 22 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 10:34:52,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-19 10:34:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-19 10:34:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-19 10:34:52,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-07-19 10:34:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:52,485 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-19 10:34:52,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-19 10:34:52,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:34:52,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:52,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:52,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:34:52,487 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-07-19 10:34:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109338688] [2022-07-19 10:34:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:52,564 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 10:34:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:52,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109338688] [2022-07-19 10:34:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109338688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:34:52,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:34:52,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:34:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381308253] [2022-07-19 10:34:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:34:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:34:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:34:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:34:52,568 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:52,616 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-07-19 10:34:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:34:52,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-19 10:34:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:52,618 INFO L225 Difference]: With dead ends: 28 [2022-07-19 10:34:52,618 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 10:34:52,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:34:52,620 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:52,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 10:34:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-19 10:34:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-19 10:34:52,625 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2022-07-19 10:34:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:52,625 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-19 10:34:52,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-19 10:34:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:34:52,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:52,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:52,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:34:52,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-07-19 10:34:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:52,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551004768] [2022-07-19 10:34:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:34:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:52,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551004768] [2022-07-19 10:34:52,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551004768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:34:52,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:34:52,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:34:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208924046] [2022-07-19 10:34:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:34:52,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:34:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:34:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:34:52,723 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:52,764 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-19 10:34:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:34:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:34:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:52,768 INFO L225 Difference]: With dead ends: 25 [2022-07-19 10:34:52,769 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 10:34:52,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:34:52,772 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:52,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:34:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 10:34:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-07-19 10:34:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-19 10:34:52,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2022-07-19 10:34:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:52,782 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-19 10:34:52,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-19 10:34:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:34:52,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:52,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:52,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:34:52,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2022-07-19 10:34:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:52,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908799327] [2022-07-19 10:34:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908799327] [2022-07-19 10:34:52,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908799327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:52,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484163155] [2022-07-19 10:34:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:52,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:52,916 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 10:34:52,917 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 10:34:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:52,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:34:52,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:53,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:53,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484163155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:53,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:53,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:34:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900980813] [2022-07-19 10:34:53,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:53,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:34:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:53,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:34:53,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:34:53,140 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:53,238 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-19 10:34:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:34:53,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:34:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:53,247 INFO L225 Difference]: With dead ends: 39 [2022-07-19 10:34:53,247 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 10:34:53,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:34:53,265 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:53,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:34:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 10:34:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-07-19 10:34:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-19 10:34:53,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-07-19 10:34:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:53,276 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-19 10:34:53,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-19 10:34:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:34:53,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:53,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:53,312 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 10:34:53,507 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 10:34:53,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2022-07-19 10:34:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:53,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076872916] [2022-07-19 10:34:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:53,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076872916] [2022-07-19 10:34:53,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076872916] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:53,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112891243] [2022-07-19 10:34:53,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:34:53,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:53,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:53,992 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 10:34:53,995 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 10:34:54,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:34:54,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:54,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 10:34:54,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:54,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-19 10:34:54,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:54,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-19 10:34:54,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:54,340 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 10:34:54,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2022-07-19 10:34:54,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:54,554 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-07-19 10:34:54,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, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 13 [2022-07-19 10:34:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:54,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:57,056 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 114 treesize of output 106 [2022-07-19 10:34:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:57,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112891243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:57,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:57,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-07-19 10:34:57,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461926608] [2022-07-19 10:34:57,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:57,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 10:34:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 10:34:57,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=890, Unknown=1, NotChecked=0, Total=1056 [2022-07-19 10:34:57,385 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:57,944 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-07-19 10:34:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:34:57,945 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:34:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:57,946 INFO L225 Difference]: With dead ends: 40 [2022-07-19 10:34:57,946 INFO L226 Difference]: Without dead ends: 29 [2022-07-19 10:34:57,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=318, Invalid=1573, Unknown=1, NotChecked=0, Total=1892 [2022-07-19 10:34:57,947 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:57,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 74 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 200 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-07-19 10:34:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-19 10:34:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-19 10:34:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-19 10:34:57,952 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-07-19 10:34:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:57,952 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-19 10:34:57,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-19 10:34:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:34:57,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:57,953 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:57,982 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 10:34:58,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:58,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2022-07-19 10:34:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:58,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440283940] [2022-07-19 10:34:58,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:58,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:58,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440283940] [2022-07-19 10:34:58,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440283940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524507266] [2022-07-19 10:34:58,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:34:58,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:58,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:58,288 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 10:34:58,315 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 10:34:58,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:34:58,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:58,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:34:58,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:58,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:34:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:58,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524507266] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:34:58,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:34:58,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:34:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928301518] [2022-07-19 10:34:58,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:34:58,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:34:58,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:34:58,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:34:58,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:34:58,465 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:34:58,571 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-07-19 10:34:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:34:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:34:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:34:58,574 INFO L225 Difference]: With dead ends: 56 [2022-07-19 10:34:58,574 INFO L226 Difference]: Without dead ends: 39 [2022-07-19 10:34:58,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:34:58,578 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:34:58,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 35 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:34:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-19 10:34:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-07-19 10:34:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-19 10:34:58,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2022-07-19 10:34:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:34:58,589 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-19 10:34:58,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:34:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-19 10:34:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:34:58,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:34:58,591 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:34:58,617 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 10:34:58,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:58,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:34:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:34:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2022-07-19 10:34:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:34:58,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082049893] [2022-07-19 10:34:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:34:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:34:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:34:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:34:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082049893] [2022-07-19 10:34:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082049893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:34:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559202424] [2022-07-19 10:34:59,303 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:34:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:34:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:34:59,308 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 10:34:59,316 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 10:34:59,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:34:59,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:34:59,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 10:34:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:34:59,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 10:34:59,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:34:59,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-19 10:34:59,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:34:59,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-07-19 10:34:59,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2022-07-19 10:34:59,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:34:59,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-07-19 10:34:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:34:59,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:35:18,691 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:35:18,692 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 914 treesize of output 890 [2022-07-19 10:35:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:19,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559202424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:35:19,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:35:19,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-07-19 10:35:19,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932723386] [2022-07-19 10:35:19,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:35:19,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:35:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:35:19,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:35:19,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1262, Unknown=8, NotChecked=0, Total=1482 [2022-07-19 10:35:19,212 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:35:31,142 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2022-07-19 10:35:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 10:35:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-19 10:35:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:35:31,145 INFO L225 Difference]: With dead ends: 71 [2022-07-19 10:35:31,145 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 10:35:31,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=361, Invalid=2178, Unknown=11, NotChecked=0, Total=2550 [2022-07-19 10:35:31,147 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:35:31,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 286 Invalid, 0 Unknown, 201 Unchecked, 0.2s Time] [2022-07-19 10:35:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 10:35:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2022-07-19 10:35:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-07-19 10:35:31,156 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 26 [2022-07-19 10:35:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:35:31,157 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-07-19 10:35:31,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-07-19 10:35:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:35:31,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:35:31,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:35:31,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 10:35:31,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:31,371 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:35:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:35:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 5 times [2022-07-19 10:35:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:35:31,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915380753] [2022-07-19 10:35:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:35:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:35:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:35:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:35:31,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915380753] [2022-07-19 10:35:31,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915380753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:35:31,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209440760] [2022-07-19 10:35:31,472 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:35:31,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:31,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:35:31,474 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 10:35:31,475 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 10:35:31,562 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-19 10:35:31,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:35:31,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:35:31,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:35:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:31,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:35:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209440760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:35:31,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:35:31,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:35:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014340448] [2022-07-19 10:35:31,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:35:31,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:35:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:35:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:35:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:35:31,690 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:35:31,850 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-07-19 10:35:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:35:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:35:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:35:31,852 INFO L225 Difference]: With dead ends: 83 [2022-07-19 10:35:31,853 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 10:35:31,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-07-19 10:35:31,854 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:35:31,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 42 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:35:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 10:35:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-07-19 10:35:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-19 10:35:31,865 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2022-07-19 10:35:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:35:31,865 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-19 10:35:31,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-19 10:35:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:35:31,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:35:31,866 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:35:31,883 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 10:35:32,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:32,072 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:35:32,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:35:32,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1914654111, now seen corresponding path program 6 times [2022-07-19 10:35:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:35:32,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640361894] [2022-07-19 10:35:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:35:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:35:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:35:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:35:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640361894] [2022-07-19 10:35:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640361894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:35:32,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976551101] [2022-07-19 10:35:32,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:35:32,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:32,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:35:32,176 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 10:35:32,178 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 10:35:32,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-19 10:35:32,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:35:32,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:35:32,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:35:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:35:32,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:35:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:35:32,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976551101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:35:32,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:35:32,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-07-19 10:35:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593701299] [2022-07-19 10:35:32,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:35:32,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:35:32,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:35:32,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:35:32,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:35:32,419 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:35:32,736 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-07-19 10:35:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:35:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-19 10:35:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:35:32,738 INFO L225 Difference]: With dead ends: 67 [2022-07-19 10:35:32,738 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 10:35:32,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:35:32,739 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:35:32,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:35:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 10:35:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-07-19 10:35:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-07-19 10:35:32,746 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 30 [2022-07-19 10:35:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:35:32,747 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-07-19 10:35:32,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:35:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-07-19 10:35:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:35:32,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:35:32,748 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:35:32,765 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 10:35:32,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:32,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:35:32,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:35:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 7 times [2022-07-19 10:35:32,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:35:32,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324023784] [2022-07-19 10:35:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:35:32,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:35:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:35:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:35:33,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324023784] [2022-07-19 10:35:33,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324023784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:35:33,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647713049] [2022-07-19 10:35:33,740 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:35:33,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:35:33,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:35:33,741 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 10:35:33,742 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 10:35:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:35:33,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 10:35:33,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:35:33,805 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 10 treesize of output 8 [2022-07-19 10:35:33,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 10:35:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:33,948 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 32 treesize of output 31 [2022-07-19 10:35:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:34,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:34,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:34,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2022-07-19 10:35:36,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 95 [2022-07-19 10:35:36,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:35:36,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 103 [2022-07-19 10:35:36,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:36,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:35:36,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 103 [2022-07-19 10:35:38,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:38,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:35:38,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:38,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 102 [2022-07-19 10:35:38,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:38,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:38,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:35:38,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 34 [2022-07-19 10:35:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:35:38,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:35:49,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_276)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_281 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)) (let ((.cse2 (mod |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or (and (not (= .cse2 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (not (<= v_ArrVal_276 .cse2))) (< .cse2 (+ v_ArrVal_276 4)))) (not (<= v_ArrVal_277 0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))))))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2022-07-19 10:35:51,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_279 Int) (v_ArrVal_277 Int) (v_ArrVal_276 Int) (~N~0 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_281 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_276)))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (let ((.cse1 (mod .cse0 4))) (and (or (and (< .cse0 0) (not (= .cse1 0))) (not (<= v_ArrVal_276 .cse1))) (< .cse1 (+ v_ArrVal_276 4)))) (not (<= v_ArrVal_277 0)) (not (< .cse0 ~N~0)) (not (<= v_ArrVal_281 (+ v_ArrVal_279 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_279)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_279 (+ v_ArrVal_277 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_277)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (<= (+ v_ArrVal_281 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_281)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* 3 ~N~0)))))) is different from false [2022-07-19 10:36:14,958 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-19 10:36:14,959 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 16588 treesize of output 16372 [2022-07-19 10:36:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-19 10:36:20,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647713049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:36:20,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:36:20,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 50 [2022-07-19 10:36:20,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661252273] [2022-07-19 10:36:20,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:36:20,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-19 10:36:20,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:36:20,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-19 10:36:20,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2003, Unknown=13, NotChecked=186, Total=2450 [2022-07-19 10:36:20,066 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:36:38,837 WARN L233 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 171 DAG size of output: 118 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:37:28,813 WARN L233 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:37:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:37:43,928 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-07-19 10:37:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-19 10:37:43,929 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-19 10:37:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:37:43,929 INFO L225 Difference]: With dead ends: 73 [2022-07-19 10:37:43,930 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 10:37:43,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 120.7s TimeCoverageRelationStatistics Valid=378, Invalid=2899, Unknown=37, NotChecked=226, Total=3540 [2022-07-19 10:37:43,931 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:37:43,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 134 Unchecked, 0.1s Time] [2022-07-19 10:37:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 10:37:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 35. [2022-07-19 10:37:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:37:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-19 10:37:43,941 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2022-07-19 10:37:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:37:43,941 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-19 10:37:43,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.58) internal successors, (79), 50 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:37:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-19 10:37:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:37:43,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:37:43,943 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:37:43,960 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 10:37:44,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:37:44,152 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:37:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:37:44,152 INFO L85 PathProgramCache]: Analyzing trace with hash 697103841, now seen corresponding path program 8 times [2022-07-19 10:37:44,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:37:44,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506333933] [2022-07-19 10:37:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:37:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:37:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:37:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:37:44,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:37:44,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506333933] [2022-07-19 10:37:44,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506333933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:37:44,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844515405] [2022-07-19 10:37:44,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:37:44,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:37:44,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:37:44,257 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 10:37:44,257 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 10:37:44,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:37:44,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:37:44,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:37:44,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:37:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:37:44,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:37:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:37:44,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844515405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:37:44,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:37:44,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-19 10:37:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199861214] [2022-07-19 10:37:44,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:37:44,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:37:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:37:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:37:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:37:44,471 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:37:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:37:44,627 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-19 10:37:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:37:44,627 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:37:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:37:44,628 INFO L225 Difference]: With dead ends: 61 [2022-07-19 10:37:44,628 INFO L226 Difference]: Without dead ends: 40 [2022-07-19 10:37:44,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:37:44,629 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:37:44,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:37:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-19 10:37:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-19 10:37:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:37:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-07-19 10:37:44,639 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2022-07-19 10:37:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:37:44,640 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-07-19 10:37:44,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:37:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-07-19 10:37:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:37:44,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:37:44,641 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:37:44,659 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 10:37:44,847 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,SelfDestructingSolverStorable10 [2022-07-19 10:37:44,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:37:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:37:44,848 INFO L85 PathProgramCache]: Analyzing trace with hash -880704545, now seen corresponding path program 9 times [2022-07-19 10:37:44,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:37:44,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930492667] [2022-07-19 10:37:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:37:44,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:37:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:37:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:37:45,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:37:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930492667] [2022-07-19 10:37:45,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930492667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:37:45,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105877302] [2022-07-19 10:37:45,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:37:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:37:45,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:37:45,880 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 10:37:45,881 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 10:37:45,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-19 10:37:45,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:37:45,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-19 10:37:45,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:37:46,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 10:37:46,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:46,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-19 10:37:46,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:46,220 INFO L356 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2022-07-19 10:37:46,220 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 48 [2022-07-19 10:37:46,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:46,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:46,404 INFO L356 Elim1Store]: treesize reduction 78, result has 28.4 percent of original size [2022-07-19 10:37:46,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 90 [2022-07-19 10:37:53,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:53,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:53,668 INFO L356 Elim1Store]: treesize reduction 348, result has 0.3 percent of original size [2022-07-19 10:37:53,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 217 treesize of output 231 [2022-07-19 10:37:54,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:37:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:54,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:54,793 INFO L356 Elim1Store]: treesize reduction 356, result has 0.3 percent of original size [2022-07-19 10:37:54,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 241 treesize of output 241 [2022-07-19 10:37:57,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:57,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:37:57,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:37:57,904 INFO L356 Elim1Store]: treesize reduction 368, result has 0.3 percent of original size [2022-07-19 10:37:57,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 253 treesize of output 244 [2022-07-19 10:38:02,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:02,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:02,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:02,510 INFO L356 Elim1Store]: treesize reduction 440, result has 0.2 percent of original size [2022-07-19 10:38:02,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 255 treesize of output 252 [2022-07-19 10:38:11,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:11,959 INFO L356 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2022-07-19 10:38:11,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 105 [2022-07-19 10:38:12,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:38:12,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:38:12,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:38:12,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 29 [2022-07-19 10:38:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:38:12,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:38:33,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| Int) (v_ArrVal_388 Int) (v_ArrVal_385 Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| Int) (v_ArrVal_395 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 4)) (.cse7 (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 16)) (.cse8 (* 16 |aux_div_ULTIMATE.start_main_~i~0#1_42|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (- 16) .cse6 .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) v_ArrVal_385) (+ .cse6 .cse7 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) v_ArrVal_388)))) (.cse5 (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 4))) (let ((.cse0 (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| (* |aux_div_ULTIMATE.start_main_~i~0#1_42| 4))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_131| 4)) (.cse1 (+ .cse5 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53|)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< .cse0 (+ c_~N~0 2)) (<= (+ c_~N~0 3) .cse0) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| v_ArrVal_385) (<= 7 .cse1) (< .cse1 3) (< (+ v_ArrVal_389 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_391) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 0) (<= (+ v_ArrVal_395 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse4))) (* c_~N~0 3)) (< 0 v_ArrVal_389) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_131| 1)) (<= 4 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53|) (< (+ v_ArrVal_393 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) v_ArrVal_395) (< |v_ULTIMATE.start_main_~i~0#1_131| 3) (< .cse1 (+ v_ArrVal_388 3)) (< (+ v_ArrVal_391 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_393) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_131|) c_~N~0))))) is different from false [2022-07-19 10:38:37,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_389 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| Int) (v_ArrVal_388 Int) (v_ArrVal_385 Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| Int) (v_ArrVal_395 Int) (v_ArrVal_383 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 4)) (.cse8 (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 16)) (.cse9 (* 16 |aux_div_ULTIMATE.start_main_~i~0#1_42|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_383) (+ (- 16) .cse7 .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) v_ArrVal_385) (+ .cse7 .cse8 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) v_ArrVal_388)))) (.cse6 (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 4))) (let ((.cse0 (+ .cse6 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| (* |aux_div_ULTIMATE.start_main_~i~0#1_42| 4))) (.cse2 (+ .cse6 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_131| 4))) (or (< .cse0 (+ c_~N~0 2)) (<= (+ c_~N~0 3) .cse0) (let ((.cse1 (mod |c_ULTIMATE.start_main_~i~0#1| 4))) (and (or (and (not (= .cse1 0)) (< |c_ULTIMATE.start_main_~i~0#1| 0)) (not (<= v_ArrVal_383 .cse1))) (< .cse1 (+ v_ArrVal_383 4)))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| v_ArrVal_385) (<= 7 .cse2) (< .cse2 3) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 0) (< 0 v_ArrVal_389) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_131| 1)) (<= 4 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53|) (<= (+ v_ArrVal_395 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse5))) (* c_~N~0 3)) (< (+ v_ArrVal_389 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_391) (< |v_ULTIMATE.start_main_~i~0#1_131| 3) (< (+ v_ArrVal_391 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_393) (< .cse2 (+ v_ArrVal_388 3)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_131|) c_~N~0) (< (+ v_ArrVal_393 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse5))) v_ArrVal_395))))) is different from false [2022-07-19 10:38:40,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_389 Int) (|aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| Int) (v_ArrVal_388 Int) (v_ArrVal_385 Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| Int) (v_ArrVal_395 Int) (v_ArrVal_383 Int) (v_ArrVal_393 Int) (v_ArrVal_391 Int) (|aux_div_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 4)) (.cse9 (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 16)) (.cse10 (* 16 |aux_div_ULTIMATE.start_main_~i~0#1_42|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_383) (+ (- 16) .cse8 .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) v_ArrVal_385) (+ .cse8 .cse9 (- 12) |c_ULTIMATE.start_main_~a~0#1.offset| .cse10) v_ArrVal_388)))) (.cse7 (* |aux_div_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 4))) (let ((.cse0 (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| (* |aux_div_ULTIMATE.start_main_~i~0#1_42| 4))) (.cse5 (+ .cse7 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53|)) (.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_131| 4))) (or (< .cse0 (+ c_~N~0 2)) (<= (+ c_~N~0 3) .cse0) (< (+ v_ArrVal_389 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_391) (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse3 (mod .cse4 4))) (and (or (not (<= v_ArrVal_383 .cse3)) (and (< .cse4 0) (not (= .cse3 0)))) (< .cse3 (+ v_ArrVal_383 4))))) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| v_ArrVal_385) (<= 7 .cse5) (<= (+ v_ArrVal_395 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_395)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4 .cse6))) (* c_~N~0 3)) (< .cse5 3) (< |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53| 0) (< 0 v_ArrVal_389) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_131| 1)) (<= 4 |aux_mod_aux_mod_ULTIMATE.start_main_~i~0#1_42_53|) (< |v_ULTIMATE.start_main_~i~0#1_131| 3) (< .cse5 (+ v_ArrVal_388 3)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_131|) c_~N~0) (< (+ v_ArrVal_391 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_391)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_393) (< (+ v_ArrVal_393 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_393)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6))) v_ArrVal_395))))) is different from false [2022-07-19 10:38:40,643 INFO L356 Elim1Store]: treesize reduction 87, result has 1.1 percent of original size [2022-07-19 10:38:40,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204771 treesize of output 203563