./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/s4lif.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 b9b6be32708c9c869a7ef906994ed167b62b1be5ed541f61924ceda8b83e642a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:31:26,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:31:26,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:31:26,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:31:26,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:31:26,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:31:26,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:31:26,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:31:26,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:31:26,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:31:26,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:31:26,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:31:26,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:31:26,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:31:26,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:31:26,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:31:26,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:31:26,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:31:26,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:31:26,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:31:26,822 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:31:26,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:31:26,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:31:26,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:31:26,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:31:26,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:31:26,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:31:26,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:31:26,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:31:26,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:31:26,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:31:26,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:31:26,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:31:26,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:31:26,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:31:26,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:31:26,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:31:26,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:31:26,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:31:26,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:31:26,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:31:26,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:31:26,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:31:26,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:31:26,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:31:26,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:31:26,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:31:26,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:31:26,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:31:26,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:31:26,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:31:26,875 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:31:26,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:31:26,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:31:26,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:31:26,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:31:26,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:31:26,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:31:26,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:31:26,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:31:26,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:31:26,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:31:26,877 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:31:26,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:31:26,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:31:26,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:31:26,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:31:26,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:31:26,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:31:26,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:31:26,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:31:26,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:31:26,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:31:26,880 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:31:26,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:31:26,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:31:26,880 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 -> b9b6be32708c9c869a7ef906994ed167b62b1be5ed541f61924ceda8b83e642a [2022-07-11 23:31:27,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:31:27,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:31:27,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:31:27,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:31:27,131 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:31:27,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4lif.c [2022-07-11 23:31:27,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dadbd28/a97db3dbe5e74ea8bd0a3b336d9ca9c4/FLAGbc8c0515a [2022-07-11 23:31:27,546 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:31:27,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4lif.c [2022-07-11 23:31:27,552 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dadbd28/a97db3dbe5e74ea8bd0a3b336d9ca9c4/FLAGbc8c0515a [2022-07-11 23:31:27,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4dadbd28/a97db3dbe5e74ea8bd0a3b336d9ca9c4 [2022-07-11 23:31:27,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:31:27,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:31:27,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:31:27,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:31:27,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:31:27,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:31:27" (1/1) ... [2022-07-11 23:31:27,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60abbd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:27, skipping insertion in model container [2022-07-11 23:31:27,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:31:27" (1/1) ... [2022-07-11 23:31:27,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:31:28,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:31:28,127 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/s4lif.c[588,601] [2022-07-11 23:31:28,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:31:28,157 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:31:28,172 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/s4lif.c[588,601] [2022-07-11 23:31:28,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:31:28,206 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:31:28,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28 WrapperNode [2022-07-11 23:31:28,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:31:28,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:31:28,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:31:28,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:31:28,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,240 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-11 23:31:28,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:31:28,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:31:28,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:31:28,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:31:28,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:31:28,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:31:28,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:31:28,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:31:28,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (1/1) ... [2022-07-11 23:31:28,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:31:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:28,292 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-11 23:31:28,322 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-11 23:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:31:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:31:28,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:31:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:31:28,399 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:31:28,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:31:28,508 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:31:28,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:31:28,513 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:31:28,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:31:28 BoogieIcfgContainer [2022-07-11 23:31:28,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:31:28,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:31:28,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:31:28,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:31:28,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:31:27" (1/3) ... [2022-07-11 23:31:28,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57207bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:31:28, skipping insertion in model container [2022-07-11 23:31:28,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:31:28" (2/3) ... [2022-07-11 23:31:28,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57207bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:31:28, skipping insertion in model container [2022-07-11 23:31:28,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:31:28" (3/3) ... [2022-07-11 23:31:28,533 INFO L111 eAbstractionObserver]: Analyzing ICFG s4lif.c [2022-07-11 23:31:28,545 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:31:28,546 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:31:28,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:31:28,589 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@6d467e6f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f9422a8 [2022-07-11 23:31:28,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:31:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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-11 23:31:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:31:28,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:28,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:28,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-11 23:31:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:28,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026049075] [2022-07-11 23:31:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:28,719 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-11 23:31:28,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:28,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026049075] [2022-07-11 23:31:28,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026049075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:31:28,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:31:28,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:31:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134846456] [2022-07-11 23:31:28,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:31:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:31:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:31:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:31:28,751 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-11 23:31:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:28,768 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-11 23:31:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:31:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-11 23:31:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:28,777 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:31:28,778 INFO L226 Difference]: Without dead ends: 18 [2022-07-11 23:31:28,784 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-11 23:31:28,791 INFO L413 NwaCegarLoop]: 26 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, 26 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-11 23:31:28,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:31:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-11 23:31:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-11 23:31:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-11 23:31:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-11 23:31:28,813 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-11 23:31:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:28,814 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-11 23:31:28,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-11 23:31:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-11 23:31:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:31:28,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:28,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:28,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:31:28,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-11 23:31:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:28,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800015509] [2022-07-11 23:31:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:28,936 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-11 23:31:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:28,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800015509] [2022-07-11 23:31:28,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800015509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:31:28,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:31:28,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:31:28,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552793143] [2022-07-11 23:31:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:31:28,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:31:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:28,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:31:28,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:31:28,940 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 23:31:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:29,012 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-11 23:31:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:31:29,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-11 23:31:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:29,013 INFO L225 Difference]: With dead ends: 36 [2022-07-11 23:31:29,013 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 23:31:29,014 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-11 23:31:29,015 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:29,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 23:31:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-11 23:31:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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-11 23:31:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-11 23:31:29,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-11 23:31:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:29,021 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-11 23:31:29,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11 23:31:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-11 23:31:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:31:29,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:29,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:29,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:31:29,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-11 23:31:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44729300] [2022-07-11 23:31:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44729300] [2022-07-11 23:31:29,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44729300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059643024] [2022-07-11 23:31:29,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:29,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:29,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:29,520 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-11 23:31:29,523 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-11 23:31:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:29,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-11 23:31:29,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:29,661 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-11 23:31:29,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:29,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:29,860 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 0 case distinctions, treesize of input 32 treesize of output 23 [2022-07-11 23:31:29,974 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 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-11 23:31:30,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-11 23:31:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:30,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:30,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:30,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-07-11 23:31:30,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:31:30,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-11 23:31:30,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:30,476 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 20 treesize of output 12 [2022-07-11 23:31:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059643024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:30,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:30,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-07-11 23:31:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064158249] [2022-07-11 23:31:30,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:30,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 23:31:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:30,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 23:31:30,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:31:30,495 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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-11 23:31:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:30,851 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-11 23:31:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:31:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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) Word has length 20 [2022-07-11 23:31:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:30,853 INFO L225 Difference]: With dead ends: 46 [2022-07-11 23:31:30,854 INFO L226 Difference]: Without dead ends: 42 [2022-07-11 23:31:30,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2022-07-11 23:31:30,855 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:30,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 181 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-07-11 23:31:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-11 23:31:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-07-11 23:31:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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-11 23:31:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-11 23:31:30,862 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-11 23:31:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:30,863 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-11 23:31:30,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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-11 23:31:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-11 23:31:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:31:30,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:30,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:30,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:31,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:31,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:31,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-11 23:31:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:31,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361995781] [2022-07-11 23:31:31,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:31,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:31,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361995781] [2022-07-11 23:31:31,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361995781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:31,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417929568] [2022-07-11 23:31:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:31,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:31,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:31,212 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-11 23:31:31,213 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-11 23:31:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:31,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:31:31,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:31,286 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 18 treesize of output 14 [2022-07-11 23:31:31,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:31:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:31,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:31,349 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 14 treesize of output 12 [2022-07-11 23:31:31,352 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 22 treesize of output 20 [2022-07-11 23:31:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:31,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417929568] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:31,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:31,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-11 23:31:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641562508] [2022-07-11 23:31:31,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:31,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:31:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:31:31,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:31:31,369 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-11 23:31:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:31,435 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-07-11 23:31:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:31:31,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 20 [2022-07-11 23:31:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:31,436 INFO L225 Difference]: With dead ends: 48 [2022-07-11 23:31:31,436 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:31:31,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:31:31,437 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:31,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:31:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:31:31,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-11 23:31:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-11 23:31:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-11 23:31:31,443 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-07-11 23:31:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:31,443 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-11 23:31:31,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-11 23:31:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-11 23:31:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:31:31,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:31,444 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:31,469 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-11 23:31:31,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 23:31:31,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:31,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:31,668 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-11 23:31:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:31,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917407029] [2022-07-11 23:31:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:31,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917407029] [2022-07-11 23:31:31,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917407029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:31,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107367521] [2022-07-11 23:31:31,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:31,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:31,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:31,756 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-11 23:31:31,785 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-11 23:31:31,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:31,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:31,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:31:31,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:31,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:31,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:31,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107367521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:31,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:31,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:31:31,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128040944] [2022-07-11 23:31:31,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:31:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:31,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:31:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:31:31,878 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-11 23:31:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:31,969 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-11 23:31:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:31:31,970 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 22 [2022-07-11 23:31:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:31,970 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:31:31,970 INFO L226 Difference]: Without dead ends: 44 [2022-07-11 23:31:31,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 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-11 23:31:31,972 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:31,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-11 23:31:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-11 23:31:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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-11 23:31:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-11 23:31:31,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-11 23:31:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:31,978 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-11 23:31:31,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-11 23:31:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-11 23:31:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:31:31,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:31,979 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:32,002 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-11 23:31:32,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:32,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:32,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-11 23:31:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836457653] [2022-07-11 23:31:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:32,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:32,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:32,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836457653] [2022-07-11 23:31:32,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836457653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:32,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061477721] [2022-07-11 23:31:32,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:31:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:32,265 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-11 23:31:32,266 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-11 23:31:32,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:31:32,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:32,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:31:32,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:32,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:31:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061477721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:32,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:32,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:31:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933494573] [2022-07-11 23:31:32,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:32,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:31:32,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:31:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:31:32,404 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-11 23:31:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:32,548 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-11 23:31:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:31:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) Word has length 22 [2022-07-11 23:31:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:32,549 INFO L225 Difference]: With dead ends: 39 [2022-07-11 23:31:32,550 INFO L226 Difference]: Without dead ends: 31 [2022-07-11 23:31:32,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:31:32,551 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:32,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-11 23:31:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-11 23:31:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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-11 23:31:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-11 23:31:32,555 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-11 23:31:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:32,555 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-11 23:31:32,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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-11 23:31:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-11 23:31:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:31:32,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:32,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:32,587 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-11 23:31:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:32,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:32,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-11 23:31:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:32,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479772521] [2022-07-11 23:31:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:33,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479772521] [2022-07-11 23:31:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479772521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:33,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425221515] [2022-07-11 23:31:33,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:31:33,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:33,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:33,539 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-11 23:31:33,553 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-11 23:31:33,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:31:33,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:33,628 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-11 23:31:33,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:33,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:33,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:33,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:33,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:33,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:33,948 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:31:34,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:34,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:34,109 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 45 treesize of output 35 [2022-07-11 23:31:34,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:34,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:34,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:34,253 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 51 treesize of output 41 [2022-07-11 23:31:34,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:34,364 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 47 treesize of output 37 [2022-07-11 23:31:34,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:34,460 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 58 treesize of output 34 [2022-07-11 23:31:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:34,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:35,320 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-11 23:31:35,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 73 [2022-07-11 23:31:35,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 4) (select v_arrayElimArr_3 .cse0)) 1)) (not (= 5 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ 5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse3)))) (* 5 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:31:35,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 4) (select v_arrayElimArr_3 .cse0)) 1)) (not (= 5 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ 5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse3)))) (* 5 ~N~0))))) is different from false [2022-07-11 23:31:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-11 23:31:35,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425221515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:35,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:35,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 50 [2022-07-11 23:31:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983406864] [2022-07-11 23:31:35,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:35,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-11 23:31:35,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:35,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-11 23:31:35,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1935, Unknown=2, NotChecked=186, Total=2450 [2022-07-11 23:31:35,397 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-11 23:31:39,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:39,222 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-07-11 23:31:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-11 23:31:39,223 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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 27 [2022-07-11 23:31:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:39,224 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:31:39,224 INFO L226 Difference]: Without dead ends: 72 [2022-07-11 23:31:39,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1063, Invalid=5263, Unknown=2, NotChecked=314, Total=6642 [2022-07-11 23:31:39,227 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:39,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 110 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 612 Invalid, 0 Unknown, 128 Unchecked, 0.7s Time] [2022-07-11 23:31:39,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-11 23:31:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2022-07-11 23:31:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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-11 23:31:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-11 23:31:39,235 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2022-07-11 23:31:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:39,235 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-11 23:31:39,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-11 23:31:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-11 23:31:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:31:39,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:39,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:39,258 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-11 23:31:39,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:39,452 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-11 23:31:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236104469] [2022-07-11 23:31:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:31:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:39,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236104469] [2022-07-11 23:31:39,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236104469] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:39,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234851129] [2022-07-11 23:31:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:39,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:39,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:39,619 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-11 23:31:39,626 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-11 23:31:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:39,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-11 23:31:39,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:39,695 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-11 23:31:39,725 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:31:39,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:31:39,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:31:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:31:39,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:39,797 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 16 treesize of output 14 [2022-07-11 23:31:39,799 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 28 treesize of output 24 [2022-07-11 23:31:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:31:39,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234851129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:39,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:39,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-11 23:31:39,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793751778] [2022-07-11 23:31:39,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:39,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:31:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:31:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:31:39,817 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-11 23:31:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:40,043 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-11 23:31:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:31:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) Word has length 27 [2022-07-11 23:31:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:40,044 INFO L225 Difference]: With dead ends: 63 [2022-07-11 23:31:40,044 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:31:40,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:31:40,045 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:40,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 59 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:31:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-07-11 23:31:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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-11 23:31:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-07-11 23:31:40,053 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2022-07-11 23:31:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:40,054 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-07-11 23:31:40,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-11 23:31:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-07-11 23:31:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:31:40,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:40,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:40,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-11 23:31:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:40,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-11 23:31:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627071694] [2022-07-11 23:31:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:31:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:40,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627071694] [2022-07-11 23:31:40,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627071694] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:40,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646134602] [2022-07-11 23:31:40,311 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:31:40,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:40,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:40,313 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-11 23:31:40,320 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-11 23:31:40,401 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:31:40,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:40,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:31:40,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:31:40,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:31:40,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646134602] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:40,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:40,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:31:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134099696] [2022-07-11 23:31:40,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:40,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:31:40,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:31:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:31:40,501 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-11 23:31:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:40,618 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-07-11 23:31:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:31:40,618 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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) Word has length 29 [2022-07-11 23:31:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:40,619 INFO L225 Difference]: With dead ends: 77 [2022-07-11 23:31:40,619 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 23:31:40,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 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-11 23:31:40,620 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:40,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 28 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 23:31:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-11 23:31:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 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-11 23:31:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-11 23:31:40,626 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-11 23:31:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:40,626 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-11 23:31:40,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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-11 23:31:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-11 23:31:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:31:40,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:40,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:40,646 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-11 23:31:40,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:40,836 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-11 23:31:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:40,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430984650] [2022-07-11 23:31:40,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:40,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:31:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:40,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430984650] [2022-07-11 23:31:40,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430984650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:40,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688495512] [2022-07-11 23:31:40,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:31:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:40,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:40,922 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-11 23:31:40,923 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-11 23:31:40,981 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:31:40,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:40,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:31:40,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:31:41,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:31:41,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688495512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:41,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:41,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:31:41,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058953898] [2022-07-11 23:31:41,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:31:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:31:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:31:41,085 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-11 23:31:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:41,197 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-11 23:31:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:31:41,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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) Word has length 32 [2022-07-11 23:31:41,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:41,199 INFO L225 Difference]: With dead ends: 42 [2022-07-11 23:31:41,199 INFO L226 Difference]: Without dead ends: 38 [2022-07-11 23:31:41,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:31:41,200 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 82 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:41,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 18 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-11 23:31:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-11 23:31:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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-11 23:31:41,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-11 23:31:41,206 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-11 23:31:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:41,206 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-11 23:31:41,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 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-11 23:31:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-11 23:31:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:31:41,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:41,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:41,234 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-11 23:31:41,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 23:31:41,417 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-11 23:31:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:41,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242137043] [2022-07-11 23:31:41,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:42,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242137043] [2022-07-11 23:31:42,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242137043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:42,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466860023] [2022-07-11 23:31:42,625 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:31:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:42,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:42,628 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-11 23:31:42,629 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-11 23:31:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-11 23:31:42,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:42,695 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-11 23:31:42,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:31:42,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:42,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:42,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:31:42,938 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:31:43,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,066 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 51 treesize of output 37 [2022-07-11 23:31:43,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 54 treesize of output 47 [2022-07-11 23:31:43,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,361 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 58 treesize of output 51 [2022-07-11 23:31:43,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:43,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:43,484 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 66 treesize of output 53 [2022-07-11 23:31:43,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 treesize of output 47 [2022-07-11 23:31:43,702 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 63 treesize of output 35 [2022-07-11 23:31:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:31:43,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:45,803 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-11 23:31:45,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-11 23:31:45,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (* 5 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 5)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= 5 (select v_arrayElimArr_4 .cse4))) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 4)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:31:45,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (* 5 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3)))))) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 5)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 (select v_arrayElimArr_4 .cse4))) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 4)) 1))))) is different from false [2022-07-11 23:31:45,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (= (* 5 ~N~0) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 5 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 5)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= 5 (select v_arrayElimArr_4 .cse4))) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 4)) 1))))) is different from false [2022-07-11 23:31:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-11 23:31:45,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466860023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:45,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:45,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-11 23:31:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298059385] [2022-07-11 23:31:45,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:45,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-11 23:31:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-11 23:31:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=3558, Unknown=3, NotChecked=378, Total=4422 [2022-07-11 23:31:45,953 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-11 23:31:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:57,472 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2022-07-11 23:31:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-11 23:31:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-11 23:31:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:57,474 INFO L225 Difference]: With dead ends: 99 [2022-07-11 23:31:57,474 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:31:57,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3342 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1114, Invalid=8597, Unknown=3, NotChecked=588, Total=10302 [2022-07-11 23:31:57,477 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 92 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:57,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 125 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 995 Invalid, 0 Unknown, 157 Unchecked, 1.3s Time] [2022-07-11 23:31:57,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:31:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-07-11 23:31:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 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-11 23:31:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-11 23:31:57,489 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-11 23:31:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:57,490 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-11 23:31:57,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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-11 23:31:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-11 23:31:57,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:31:57,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:57,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:57,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:57,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:57,699 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-11 23:31:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:57,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38864049] [2022-07-11 23:31:57,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:31:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:57,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38864049] [2022-07-11 23:31:57,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38864049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:57,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148400301] [2022-07-11 23:31:57,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:57,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:57,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:57,882 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:57,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:31:57,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:57,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:57,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:31:57,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:57,986 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-11 23:31:58,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:58,026 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 25 treesize of output 24 [2022-07-11 23:31:58,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:58,059 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 25 treesize of output 24 [2022-07-11 23:31:58,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-11 23:31:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:31:58,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:58,165 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 16 treesize of output 14 [2022-07-11 23:31:58,167 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 28 treesize of output 24 [2022-07-11 23:31:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:31:58,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148400301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:58,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:58,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-11 23:31:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908965477] [2022-07-11 23:31:58,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:58,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 23:31:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 23:31:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:31:58,203 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-11 23:31:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:58,565 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-11 23:31:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-11 23:31:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-11 23:31:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:58,566 INFO L225 Difference]: With dead ends: 76 [2022-07-11 23:31:58,566 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:31:58,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 23:31:58,567 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:58,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 87 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:31:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:31:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-11 23:31:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 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-11 23:31:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-11 23:31:58,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-11 23:31:58,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:58,579 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-11 23:31:58,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 states have internal predecessors, (63), 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-11 23:31:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-11 23:31:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:31:58,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:58,580 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:58,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-11 23:31:58,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 23:31:58,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:58,788 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-11 23:31:58,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:58,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032469225] [2022-07-11 23:31:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:58,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:31:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:58,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032469225] [2022-07-11 23:31:58,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032469225] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:58,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10209372] [2022-07-11 23:31:58,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:58,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:58,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:58,874 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:58,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:31:58,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:58,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:58,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:31:58,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:31:59,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:31:59,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10209372] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:59,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:31:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590356348] [2022-07-11 23:31:59,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:31:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:31:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:59,073 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-11 23:31:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:59,207 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-11 23:31:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:31:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 36 [2022-07-11 23:31:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:59,209 INFO L225 Difference]: With dead ends: 86 [2022-07-11 23:31:59,209 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:31:59,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:31:59,211 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 105 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:59,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 29 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:31:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-11 23:31:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 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-11 23:31:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-11 23:31:59,225 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-11 23:31:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:59,225 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-11 23:31:59,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-11 23:31:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-11 23:31:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:31:59,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:59,227 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:31:59,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:59,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 23:31:59,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:59,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-11 23:31:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:59,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006083328] [2022-07-11 23:31:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:31:59,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:59,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006083328] [2022-07-11 23:31:59,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006083328] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663440020] [2022-07-11 23:31:59,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:31:59,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:59,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:59,544 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:31:59,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 23:31:59,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:31:59,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:59,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:31:59,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:31:59,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:31:59,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663440020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:59,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:59,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:31:59,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502371939] [2022-07-11 23:31:59,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:59,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:31:59,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:59,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:31:59,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:59,793 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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-11 23:31:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:59,965 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-11 23:31:59,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:31:59,966 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 39 [2022-07-11 23:31:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:59,967 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:31:59,967 INFO L226 Difference]: Without dead ends: 45 [2022-07-11 23:31:59,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:31:59,967 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 74 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:59,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 27 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:31:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-11 23:31:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-11 23:31:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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-11 23:31:59,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-11 23:31:59,974 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-11 23:31:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:59,975 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-11 23:31:59,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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-11 23:31:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-11 23:31:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:31:59,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:59,982 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:32:00,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:32:00,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-11 23:32:00,183 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:32:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:32:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-11 23:32:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:32:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793785664] [2022-07-11 23:32:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:32:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:32:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:32:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:01,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:32:01,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793785664] [2022-07-11 23:32:01,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793785664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:32:01,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718435234] [2022-07-11 23:32:01,800 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:32:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:32:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:32:01,801 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:32:01,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 23:32:01,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:32:01,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:32:01,884 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-11 23:32:01,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:32:01,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:32:01,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:01,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:01,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:01,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:02,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:02,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:32:02,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,329 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:32:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,527 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 51 treesize of output 37 [2022-07-11 23:32:02,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 51 [2022-07-11 23:32:02,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:02,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-07-11 23:32:03,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:03,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2022-07-11 23:32:03,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:03,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 70 [2022-07-11 23:32:03,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:32:03,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2022-07-11 23:32:03,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-07-11 23:32:03,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:32:03,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 40 [2022-07-11 23:32:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:32:03,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:32:10,385 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-11 23:32:10,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-07-11 23:32:10,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 5)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 5 .cse4 .cse5)))))) (* 5 ~N~0)) (not (= 5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= 5 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 4)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:32:10,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 5)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 5 .cse4 .cse5)))))) (* 5 ~N~0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= 5 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 4)) 1))))) is different from false [2022-07-11 23:32:10,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 5)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 5 .cse4 .cse5)))))) (* 5 ~N~0)) (not (= 5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= 5 (select v_arrayElimArr_5 .cse6))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 4)) 1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:32:10,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse6 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (select v_arrayElimArr_5 .cse0) 5)) (= (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 5 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 5 .cse4 .cse5)))))) (* 5 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= 5 (select v_arrayElimArr_5 .cse6))) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 4)) 1)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-11 23:32:10,703 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-11 23:32:10,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718435234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:32:10,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:32:10,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 86 [2022-07-11 23:32:10,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612810154] [2022-07-11 23:32:10,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:32:10,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-11 23:32:10,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:32:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-11 23:32:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=722, Invalid=5932, Unknown=4, NotChecked=652, Total=7310 [2022-07-11 23:32:10,707 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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-11 23:32:45,459 WARN L233 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 207 DAG size of output: 197 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:33:11,479 WARN L233 SmtUtils]: Spent 19.71s on a formula simplification. DAG size of input: 208 DAG size of output: 193 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:33:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:33:41,069 INFO L93 Difference]: Finished difference Result 117 states and 135 transitions. [2022-07-11 23:33:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-11 23:33:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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 41 [2022-07-11 23:33:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:33:41,070 INFO L225 Difference]: With dead ends: 117 [2022-07-11 23:33:41,070 INFO L226 Difference]: Without dead ends: 97 [2022-07-11 23:33:41,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 94.6s TimeCoverageRelationStatistics Valid=1735, Invalid=14533, Unknown=4, NotChecked=1020, Total=17292 [2022-07-11 23:33:41,074 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 88 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:33:41,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 161 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1497 Invalid, 0 Unknown, 308 Unchecked, 3.7s Time] [2022-07-11 23:33:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-11 23:33:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 65. [2022-07-11 23:33:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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-11 23:33:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-11 23:33:41,090 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-11 23:33:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:33:41,091 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-11 23:33:41,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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-11 23:33:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-11 23:33:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:33:41,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:33:41,092 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:33:41,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-11 23:33:41,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-11 23:33:41,303 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:33:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:33:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-11 23:33:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:33:41,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886930544] [2022-07-11 23:33:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:33:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:33:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:33:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 23:33:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:33:41,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886930544] [2022-07-11 23:33:41,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886930544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:33:41,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668540215] [2022-07-11 23:33:41,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:33:41,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:33:41,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:33:41,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:33:41,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 23:33:41,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:33:41,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:33:41,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-11 23:33:41,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:33:41,647 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-11 23:33:41,793 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-11 23:33:41,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-11 23:33:41,863 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:33:41,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-11 23:33:41,942 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:33:41,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 47 [2022-07-11 23:33:42,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:33:42,045 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 36 treesize of output 36 [2022-07-11 23:33:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 16 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:33:42,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:33:56,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-07-11 23:33:56,380 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 37 treesize of output 30 [2022-07-11 23:33:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:33:56,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668540215] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:33:56,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:33:56,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 18] total 49 [2022-07-11 23:33:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502397960] [2022-07-11 23:33:56,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:33:56,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-11 23:33:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:33:56,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-11 23:33:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1887, Unknown=17, NotChecked=0, Total=2352 [2022-07-11 23:33:56,385 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 49 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 49 states have internal predecessors, (94), 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-11 23:34:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:00,539 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-11 23:34:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-11 23:34:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 49 states have internal predecessors, (94), 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 41 [2022-07-11 23:34:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:00,540 INFO L225 Difference]: With dead ends: 96 [2022-07-11 23:34:00,540 INFO L226 Difference]: Without dead ends: 76 [2022-07-11 23:34:00,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1930 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=937, Invalid=4444, Unknown=21, NotChecked=0, Total=5402 [2022-07-11 23:34:00,542 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:00,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 60 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 274 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-07-11 23:34:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-11 23:34:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-07-11 23:34:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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-11 23:34:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-11 23:34:00,559 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-11 23:34:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:00,560 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-11 23:34:00,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 49 states have internal predecessors, (94), 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-11 23:34:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-11 23:34:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:34:00,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:00,561 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:34:00,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-11 23:34:00,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:00,776 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-11 23:34:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:00,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378543450] [2022-07-11 23:34:00,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:00,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:34:00,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:00,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378543450] [2022-07-11 23:34:00,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378543450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:00,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138261100] [2022-07-11 23:34:00,873 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:34:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:00,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:00,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:34:00,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 23:34:01,026 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 23:34:01,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:01,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:34:01,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:34:01,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-11 23:34:01,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138261100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:01,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:01,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:34:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930652795] [2022-07-11 23:34:01,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:01,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:34:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:34:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:34:01,206 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11 23:34:01,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:01,397 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-11 23:34:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:34:01,398 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 43 [2022-07-11 23:34:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:01,398 INFO L225 Difference]: With dead ends: 109 [2022-07-11 23:34:01,398 INFO L226 Difference]: Without dead ends: 62 [2022-07-11 23:34:01,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 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-11 23:34:01,399 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 97 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:01,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 35 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:34:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-11 23:34:01,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-11 23:34:01,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 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-11 23:34:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-11 23:34:01,412 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-11 23:34:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:01,412 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-11 23:34:01,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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-11 23:34:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-11 23:34:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:34:01,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:01,412 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:34:01,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:34:01,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-11 23:34:01,631 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:01,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-11 23:34:01,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:01,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608461954] [2022-07-11 23:34:01,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:34:01,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:01,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608461954] [2022-07-11 23:34:01,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608461954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:01,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629268348] [2022-07-11 23:34:01,737 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:34:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:01,738 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:34:01,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-11 23:34:01,851 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-11 23:34:01,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:01,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:34:01,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:34:01,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:34:01,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629268348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:01,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:01,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-11 23:34:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871076230] [2022-07-11 23:34:01,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:01,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-11 23:34:01,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-11 23:34:01,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-11 23:34:01,990 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-11 23:34:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:02,198 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-11 23:34:02,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:34:02,198 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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 46 [2022-07-11 23:34:02,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:02,199 INFO L225 Difference]: With dead ends: 61 [2022-07-11 23:34:02,199 INFO L226 Difference]: Without dead ends: 57 [2022-07-11 23:34:02,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:34:02,200 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 73 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:02,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 30 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:34:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-11 23:34:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-11 23:34:02,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-11 23:34:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-11 23:34:02,211 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-11 23:34:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:02,211 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-11 23:34:02,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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-11 23:34:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-11 23:34:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:34:02,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:02,211 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:34:02,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-11 23:34:02,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-11 23:34:02,415 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:02,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-11 23:34:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:02,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139828801] [2022-07-11 23:34:02,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:34:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139828801] [2022-07-11 23:34:04,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139828801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:04,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003695403] [2022-07-11 23:34:04,411 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:34:04,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:04,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:04,412 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:34:04,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-11 23:34:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:04,492 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-11 23:34:04,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:04,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:34:04,504 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-11 23:34:04,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:34:04,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:34:04,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:34:04,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:34:04,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-11 23:34:04,913 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 0 case distinctions, treesize of input 44 treesize of output 27 [2022-07-11 23:34:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,077 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 53 treesize of output 39 [2022-07-11 23:34:05,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 67 treesize of output 56 [2022-07-11 23:34:05,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2022-07-11 23:34:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-07-11 23:34:05,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:05,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:05,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2022-07-11 23:34:06,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:06,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-07-11 23:34:06,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:06,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 84 [2022-07-11 23:34:06,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:34:06,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:34:06,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2022-07-11 23:34:06,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-07-11 23:34:06,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2022-07-11 23:34:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:34:06,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:34:27,709 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-11 23:34:27,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 2897 treesize of output 549 [2022-07-11 23:34:27,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_6 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_6 .cse1))) (not (= (+ (select v_arrayElimArr_6 .cse2) (- 4)) 1)) (not (= (+ .cse3 (- 4)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (- 4) (select v_arrayElimArr_6 .cse4)) 1)) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse10 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse7 .cse8 .cse9 .cse10))))))) (* 5 ~N~0)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-11 23:34:27,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_6 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_6 .cse1))) (not (= (+ (select v_arrayElimArr_6 .cse2) (- 4)) 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ .cse3 (- 4)) 1)) (not (= (+ (- 4) (select v_arrayElimArr_6 .cse4)) 1)) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse10 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse7 .cse8 .cse9 .cse10))))))) (* 5 ~N~0))))) is different from false [2022-07-11 23:34:27,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_6 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_6 .cse1))) (not (= (+ (select v_arrayElimArr_6 .cse2) (- 4)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (+ .cse3 (- 4)) 1)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (- 4) (select v_arrayElimArr_6 .cse4)) 1)) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse10 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse7 .cse8 .cse9 .cse10))))))) (* 5 ~N~0))))) is different from false [2022-07-11 23:34:28,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_6 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_6 .cse1))) (not (= (+ (select v_arrayElimArr_6 .cse2) (- 4)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (+ .cse3 (- 4)) 1)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (- 4) (select v_arrayElimArr_6 .cse4)) 1)) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse10 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse7 .cse8 .cse9 .cse10))))))) (* 5 ~N~0))))) is different from false [2022-07-11 23:34:28,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_6 .cse0) (- 4)) 1)) (not (= 5 (select v_arrayElimArr_6 .cse1))) (not (= (+ (select v_arrayElimArr_6 .cse2) (- 4)) 1)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= (+ .cse3 (- 4)) 1)) (not (= (+ (- 4) (select v_arrayElimArr_6 .cse4)) 1)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse10 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse3 .cse7 .cse8 .cse9 .cse10))))))) (* 5 ~N~0))))) is different from false [2022-07-11 23:34:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-11 23:34:28,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003695403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:34:28,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:34:28,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 102 [2022-07-11 23:34:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847762251] [2022-07-11 23:34:28,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:34:28,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-07-11 23:34:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:34:28,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-07-11 23:34:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=916, Invalid=8411, Unknown=5, NotChecked=970, Total=10302 [2022-07-11 23:34:28,401 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 102 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 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-11 23:35:24,418 WARN L233 SmtUtils]: Spent 28.69s on a formula simplification. DAG size of input: 143 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)