./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/nr3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/nr3.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 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 09:34:01,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 09:34:01,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 09:34:01,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 09:34:01,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 09:34:01,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 09:34:01,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 09:34:01,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 09:34:01,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 09:34:01,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 09:34:01,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 09:34:01,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 09:34:01,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 09:34:01,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 09:34:01,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 09:34:01,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 09:34:01,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 09:34:01,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 09:34:01,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 09:34:01,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 09:34:01,531 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 09:34:01,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 09:34:01,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 09:34:01,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 09:34:01,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 09:34:01,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 09:34:01,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 09:34:01,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 09:34:01,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 09:34:01,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 09:34:01,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 09:34:01,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 09:34:01,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 09:34:01,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 09:34:01,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 09:34:01,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 09:34:01,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 09:34:01,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 09:34:01,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 09:34:01,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 09:34:01,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 09:34:01,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 09:34:01,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 09:34:01,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 09:34:01,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 09:34:01,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 09:34:01,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 09:34:01,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 09:34:01,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 09:34:01,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 09:34:01,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 09:34:01,585 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 09:34:01,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 09:34:01,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 09:34:01,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 09:34:01,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 09:34:01,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 09:34:01,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 09:34:01,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 09:34:01,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 09:34:01,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 09:34:01,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 09:34:01,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 09:34:01,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 09:34:01,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 09:34:01,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 09:34:01,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 09:34:01,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 09:34:01,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 09:34:01,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 09:34:01,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 09:34:01,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 09:34:01,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 09:34:01,590 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 09:34:01,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 09:34:01,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 09:34:01,591 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 -> 4885a4fffd0288753086daaa59bdb12816a7be62636dc49311bbb97ad277d866 [2022-07-19 09:34:01,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 09:34:01,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 09:34:01,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 09:34:01,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 09:34:01,849 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 09:34:01,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/nr3.c [2022-07-19 09:34:01,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fafabf511/40c5f37c76fa426c8e6f4c710cd7848f/FLAGa6d6932bc [2022-07-19 09:34:02,357 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 09:34:02,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/nr3.c [2022-07-19 09:34:02,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fafabf511/40c5f37c76fa426c8e6f4c710cd7848f/FLAGa6d6932bc [2022-07-19 09:34:02,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fafabf511/40c5f37c76fa426c8e6f4c710cd7848f [2022-07-19 09:34:02,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 09:34:02,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 09:34:02,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 09:34:02,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 09:34:02,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 09:34:02,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:34:02" (1/1) ... [2022-07-19 09:34:02,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b71936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:02, skipping insertion in model container [2022-07-19 09:34:02,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:34:02" (1/1) ... [2022-07-19 09:34:02,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 09:34:02,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 09:34:03,021 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-tiling/nr3.c[394,407] [2022-07-19 09:34:03,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 09:34:03,056 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 09:34:03,070 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-tiling/nr3.c[394,407] [2022-07-19 09:34:03,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 09:34:03,101 INFO L208 MainTranslator]: Completed translation [2022-07-19 09:34:03,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03 WrapperNode [2022-07-19 09:34:03,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 09:34:03,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 09:34:03,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 09:34:03,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 09:34:03,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,145 INFO L137 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-07-19 09:34:03,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 09:34:03,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 09:34:03,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 09:34:03,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 09:34:03,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 09:34:03,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 09:34:03,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 09:34:03,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 09:34:03,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (1/1) ... [2022-07-19 09:34:03,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 09:34:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:03,221 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 09:34:03,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 09:34:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 09:34:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 09:34:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 09:34:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 09:34:03,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 09:34:03,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 09:34:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 09:34:03,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 09:34:03,312 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 09:34:03,314 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 09:34:03,429 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 09:34:03,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 09:34:03,435 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 09:34:03,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:34:03 BoogieIcfgContainer [2022-07-19 09:34:03,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 09:34:03,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 09:34:03,438 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 09:34:03,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 09:34:03,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:34:02" (1/3) ... [2022-07-19 09:34:03,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484f1d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:34:03, skipping insertion in model container [2022-07-19 09:34:03,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:34:03" (2/3) ... [2022-07-19 09:34:03,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484f1d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:34:03, skipping insertion in model container [2022-07-19 09:34:03,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:34:03" (3/3) ... [2022-07-19 09:34:03,463 INFO L111 eAbstractionObserver]: Analyzing ICFG nr3.c [2022-07-19 09:34:03,476 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 09:34:03,480 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 09:34:03,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 09:34:03,562 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@af36e49, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7130812e [2022-07-19 09:34:03,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 09:34:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 09:34:03,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:03,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:03,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash -405965127, now seen corresponding path program 1 times [2022-07-19 09:34:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:03,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481430870] [2022-07-19 09:34:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481430870] [2022-07-19 09:34:03,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481430870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:03,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:03,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 09:34:03,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700880413] [2022-07-19 09:34:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:03,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 09:34:03,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:03,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 09:34:03,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 09:34:03,825 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) 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-19 09:34:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:03,842 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-07-19 09:34:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 09:34:03,845 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-19 09:34:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:03,852 INFO L225 Difference]: With dead ends: 45 [2022-07-19 09:34:03,852 INFO L226 Difference]: Without dead ends: 20 [2022-07-19 09:34:03,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 09:34:03,861 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:03,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:03,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-19 09:34:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-19 09:34:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-19 09:34:03,895 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2022-07-19 09:34:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:03,896 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-19 09:34:03,897 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-19 09:34:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-19 09:34:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 09:34:03,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:03,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:03,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 09:34:03,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash 274093243, now seen corresponding path program 1 times [2022-07-19 09:34:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:03,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738911577] [2022-07-19 09:34:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:04,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738911577] [2022-07-19 09:34:04,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738911577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:04,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:04,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 09:34:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426111562] [2022-07-19 09:34:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:04,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 09:34:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:04,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 09:34:04,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 09:34:04,011 INFO L87 Difference]: Start difference. First operand 20 states and 24 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-19 09:34:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:04,048 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-07-19 09:34:04,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 09:34:04,049 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-19 09:34:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:04,050 INFO L225 Difference]: With dead ends: 29 [2022-07-19 09:34:04,050 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 09:34:04,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 09:34:04,051 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:04,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 09:34:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2022-07-19 09:34:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-19 09:34:04,057 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2022-07-19 09:34:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:04,057 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-19 09:34:04,057 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-19 09:34:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-19 09:34:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 09:34:04,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:04,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:04,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 09:34:04,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 274152825, now seen corresponding path program 1 times [2022-07-19 09:34:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:04,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066046506] [2022-07-19 09:34:04,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:04,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:04,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066046506] [2022-07-19 09:34:04,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066046506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:04,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:04,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 09:34:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563004376] [2022-07-19 09:34:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:04,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 09:34:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:04,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 09:34:04,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 09:34:04,212 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-19 09:34:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:04,272 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-07-19 09:34:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 09:34:04,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-19 09:34:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:04,274 INFO L225 Difference]: With dead ends: 38 [2022-07-19 09:34:04,275 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 09:34:04,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 09:34:04,278 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:04,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 09:34:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-19 09:34:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-19 09:34:04,291 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-07-19 09:34:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:04,291 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-19 09:34:04,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-19 09:34:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 09:34:04,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:04,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:04,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 09:34:04,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash -715167033, now seen corresponding path program 1 times [2022-07-19 09:34:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947450101] [2022-07-19 09:34:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:04,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947450101] [2022-07-19 09:34:04,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947450101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:04,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 09:34:04,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 09:34:04,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841743446] [2022-07-19 09:34:04,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:04,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 09:34:04,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:04,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 09:34:04,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 09:34:04,353 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:04,380 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-07-19 09:34:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 09:34:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 09:34:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:04,382 INFO L225 Difference]: With dead ends: 42 [2022-07-19 09:34:04,382 INFO L226 Difference]: Without dead ends: 26 [2022-07-19 09:34:04,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 09:34:04,384 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:04,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-19 09:34:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-07-19 09:34:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-19 09:34:04,398 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-07-19 09:34:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:04,399 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-19 09:34:04,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-19 09:34:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 09:34:04,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:04,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:04,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 09:34:04,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:04,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1618667584, now seen corresponding path program 1 times [2022-07-19 09:34:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:04,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936410649] [2022-07-19 09:34:04,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:04,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936410649] [2022-07-19 09:34:04,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936410649] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977160406] [2022-07-19 09:34:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:04,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:04,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:04,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:04,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 09:34:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:04,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 09:34:04,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977160406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:04,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:04,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 09:34:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822493857] [2022-07-19 09:34:04,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:04,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 09:34:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 09:34:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 09:34:04,602 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:04,640 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-19 09:34:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 09:34:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 09:34:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:04,641 INFO L225 Difference]: With dead ends: 47 [2022-07-19 09:34:04,642 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 09:34:04,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 09:34:04,644 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:04,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 09:34:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 09:34:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-07-19 09:34:04,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 19 [2022-07-19 09:34:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:04,650 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-07-19 09:34:04,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:04,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-07-19 09:34:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 09:34:04,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:04,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:04,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 09:34:04,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:04,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1797589728, now seen corresponding path program 2 times [2022-07-19 09:34:04,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:04,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127877699] [2022-07-19 09:34:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:04,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127877699] [2022-07-19 09:34:04,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127877699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:04,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436847459] [2022-07-19 09:34:04,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 09:34:04,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:04,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:04,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 09:34:05,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 09:34:05,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:34:05,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 09:34:05,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:05,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 09:34:05,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436847459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 09:34:05,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 09:34:05,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-07-19 09:34:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533444439] [2022-07-19 09:34:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 09:34:05,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 09:34:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 09:34:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-19 09:34:05,142 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:05,181 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-07-19 09:34:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 09:34:05,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2022-07-19 09:34:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:05,182 INFO L225 Difference]: With dead ends: 53 [2022-07-19 09:34:05,183 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 09:34:05,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-07-19 09:34:05,185 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:05,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 09:34:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 09:34:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-19 09:34:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-19 09:34:05,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 25 [2022-07-19 09:34:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:05,197 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-19 09:34:05,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-19 09:34:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 09:34:05,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:05,200 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:05,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 09:34:05,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-19 09:34:05,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1796312990, now seen corresponding path program 1 times [2022-07-19 09:34:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:05,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861804167] [2022-07-19 09:34:05,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:05,867 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-19 09:34:05,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861804167] [2022-07-19 09:34:05,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861804167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:05,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460366779] [2022-07-19 09:34:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:05,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:05,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:05,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:05,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 09:34:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:05,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 09:34:05,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:06,066 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-19 09:34:06,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:06,159 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 31 treesize of output 30 [2022-07-19 09:34:06,228 INFO L356 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2022-07-19 09:34:06,228 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 24 treesize of output 29 [2022-07-19 09:34:06,487 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-19 09:34:06,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:22,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2022-07-19 09:34:22,569 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 391 treesize of output 383 [2022-07-19 09:34:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 09:34:24,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460366779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:24,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:24,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 33 [2022-07-19 09:34:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595568427] [2022-07-19 09:34:24,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:24,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 09:34:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 09:34:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=890, Unknown=6, NotChecked=0, Total=1056 [2022-07-19 09:34:24,948 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:33,351 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 52 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 09:34:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:35,754 INFO L93 Difference]: Finished difference Result 85 states and 104 transitions. [2022-07-19 09:34:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 09:34:35,754 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 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 25 [2022-07-19 09:34:35,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:35,755 INFO L225 Difference]: With dead ends: 85 [2022-07-19 09:34:35,755 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 09:34:35,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=343, Invalid=1630, Unknown=7, NotChecked=0, Total=1980 [2022-07-19 09:34:35,757 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:35,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 204 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 314 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-07-19 09:34:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 09:34:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 34. [2022-07-19 09:34:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-19 09:34:35,773 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2022-07-19 09:34:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:35,774 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-19 09:34:35,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-19 09:34:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 09:34:35,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:35,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:35,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 09:34:36,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:36,001 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:36,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1325174645, now seen corresponding path program 1 times [2022-07-19 09:34:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:36,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630584530] [2022-07-19 09:34:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:36,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:36,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630584530] [2022-07-19 09:34:36,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630584530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:36,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715098786] [2022-07-19 09:34:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:36,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:36,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:36,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:36,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 09:34:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:36,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 09:34:36,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:36,478 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 16 treesize of output 12 [2022-07-19 09:34:36,536 INFO L356 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-07-19 09:34:36,537 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 26 treesize of output 31 [2022-07-19 09:34:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:36,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:39,958 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 39 treesize of output 35 [2022-07-19 09:34:39,961 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 75 treesize of output 67 [2022-07-19 09:34:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 09:34:40,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715098786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:40,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:40,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 31 [2022-07-19 09:34:40,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193314] [2022-07-19 09:34:40,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:40,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-19 09:34:40,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-19 09:34:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-07-19 09:34:40,080 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:40,574 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-07-19 09:34:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 09:34:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-19 09:34:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:40,577 INFO L225 Difference]: With dead ends: 118 [2022-07-19 09:34:40,577 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 09:34:40,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 09:34:40,578 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:40,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 188 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2022-07-19 09:34:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 09:34:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 77. [2022-07-19 09:34:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-07-19 09:34:40,593 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 31 [2022-07-19 09:34:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:40,593 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-07-19 09:34:40,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 31 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-07-19 09:34:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 09:34:40,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:40,595 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:40,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 09:34:40,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:40,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:40,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash 932147635, now seen corresponding path program 1 times [2022-07-19 09:34:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:40,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387916749] [2022-07-19 09:34:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:40,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387916749] [2022-07-19 09:34:41,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387916749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364691110] [2022-07-19 09:34:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:41,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:41,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:41,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:41,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 09:34:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:41,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 09:34:41,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:41,217 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-19 09:34:41,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:41,282 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 31 treesize of output 30 [2022-07-19 09:34:41,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:34:41,332 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 24 treesize of output 23 [2022-07-19 09:34:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:41,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:34:58,755 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 38 treesize of output 36 [2022-07-19 09:34:58,759 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 880 treesize of output 872 [2022-07-19 09:34:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:58,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364691110] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:34:58,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:34:58,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-07-19 09:34:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486376368] [2022-07-19 09:34:58,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:34:58,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 09:34:58,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:34:58,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 09:34:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=729, Unknown=8, NotChecked=0, Total=870 [2022-07-19 09:34:58,850 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 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-19 09:34:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:34:59,430 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2022-07-19 09:34:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 09:34:59,430 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 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) Word has length 31 [2022-07-19 09:34:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:34:59,431 INFO L225 Difference]: With dead ends: 130 [2022-07-19 09:34:59,431 INFO L226 Difference]: Without dead ends: 120 [2022-07-19 09:34:59,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=312, Invalid=1660, Unknown=8, NotChecked=0, Total=1980 [2022-07-19 09:34:59,433 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 141 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 09:34:59,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 172 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-07-19 09:34:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-19 09:34:59,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 80. [2022-07-19 09:34:59,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:34:59,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2022-07-19 09:34:59,448 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 31 [2022-07-19 09:34:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:34:59,448 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2022-07-19 09:34:59,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.566666666666667) internal successors, (77), 30 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-19 09:34:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2022-07-19 09:34:59,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 09:34:59,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:34:59,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:34:59,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 09:34:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:59,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:34:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:34:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1798450104, now seen corresponding path program 2 times [2022-07-19 09:34:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:34:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751576577] [2022-07-19 09:34:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:34:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:34:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:34:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:34:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:34:59,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751576577] [2022-07-19 09:34:59,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751576577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:34:59,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366453800] [2022-07-19 09:34:59,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 09:34:59,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:34:59,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:34:59,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:34:59,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 09:34:59,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 09:34:59,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:34:59,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 09:34:59,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:34:59,956 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 16 treesize of output 12 [2022-07-19 09:35:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:35:00,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:35:00,132 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-19 09:35:00,134 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 34 treesize of output 30 [2022-07-19 09:35:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:35:00,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366453800] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:35:00,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:35:00,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-07-19 09:35:00,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013707505] [2022-07-19 09:35:00,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:35:00,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 09:35:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:35:00,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 09:35:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-19 09:35:00,262 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:35:01,633 INFO L93 Difference]: Finished difference Result 264 states and 310 transitions. [2022-07-19 09:35:01,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-07-19 09:35:01,634 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 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 37 [2022-07-19 09:35:01,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:35:01,635 INFO L225 Difference]: With dead ends: 264 [2022-07-19 09:35:01,635 INFO L226 Difference]: Without dead ends: 262 [2022-07-19 09:35:01,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=921, Invalid=4481, Unknown=0, NotChecked=0, Total=5402 [2022-07-19 09:35:01,638 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 279 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 09:35:01,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 208 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 09:35:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-19 09:35:01,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 119. [2022-07-19 09:35:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.2372881355932204) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2022-07-19 09:35:01,661 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 37 [2022-07-19 09:35:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:35:01,662 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2022-07-19 09:35:01,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2022-07-19 09:35:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 09:35:01,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:35:01,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:35:01,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 09:35:01,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:35:01,877 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:35:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:35:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 996077275, now seen corresponding path program 3 times [2022-07-19 09:35:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:35:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638407189] [2022-07-19 09:35:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:35:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:35:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:35:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 09:35:02,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:35:02,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638407189] [2022-07-19 09:35:02,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638407189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:35:02,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355158378] [2022-07-19 09:35:02,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 09:35:02,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:35:02,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:35:02,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:35:02,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 09:35:02,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 09:35:02,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:35:02,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 09:35:02,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:35:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 09:35:02,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:35:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 09:35:02,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355158378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:35:02,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:35:02,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2022-07-19 09:35:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547038073] [2022-07-19 09:35:02,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:35:02,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 09:35:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:35:02,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 09:35:02,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2022-07-19 09:35:02,775 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:35:02,994 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2022-07-19 09:35:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 09:35:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 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-19 09:35:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:35:02,996 INFO L225 Difference]: With dead ends: 182 [2022-07-19 09:35:02,996 INFO L226 Difference]: Without dead ends: 152 [2022-07-19 09:35:02,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 09:35:02,998 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 191 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 09:35:02,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 143 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 09:35:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-19 09:35:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2022-07-19 09:35:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.238532110091743) internal successors, (135), 109 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2022-07-19 09:35:03,027 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 43 [2022-07-19 09:35:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:35:03,028 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-07-19 09:35:03,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.642857142857143) internal successors, (102), 28 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:35:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-07-19 09:35:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 09:35:03,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:35:03,030 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:35:03,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 09:35:03,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:35:03,230 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:35:03,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:35:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash -218220002, now seen corresponding path program 4 times [2022-07-19 09:35:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:35:03,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240522166] [2022-07-19 09:35:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:35:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:35:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:35:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:35:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:35:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240522166] [2022-07-19 09:35:03,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240522166] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:35:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959077647] [2022-07-19 09:35:03,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 09:35:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:35:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:35:03,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:35:03,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 09:35:03,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 09:35:03,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:35:03,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 09:35:03,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:35:03,920 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 16 treesize of output 12 [2022-07-19 09:35:03,975 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-19 09:35:03,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-07-19 09:35:04,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:35:04,197 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-19 09:35:04,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2022-07-19 09:35:04,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:35:04,300 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 38 treesize of output 31 [2022-07-19 09:35:04,368 INFO L356 Elim1Store]: treesize reduction 27, result has 41.3 percent of original size [2022-07-19 09:35:04,368 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 38 treesize of output 41 [2022-07-19 09:35:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:35:10,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:35:41,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse1) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (= .cse0 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |c_ULTIMATE.start_main_~j~0#1|))))) is different from false [2022-07-19 09:35:43,511 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) is different from false [2022-07-19 09:36:12,387 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 99 treesize of output 95 [2022-07-19 09:36:12,393 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 3911 treesize of output 3879 [2022-07-19 09:36:16,469 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 46 refuted. 4 times theorem prover too weak. 2 trivial. 14 not checked. [2022-07-19 09:36:16,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959077647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 09:36:16,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 09:36:16,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 18] total 51 [2022-07-19 09:36:16,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317048780] [2022-07-19 09:36:16,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 09:36:16,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 09:36:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 09:36:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 09:36:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2004, Unknown=30, NotChecked=190, Total=2550 [2022-07-19 09:36:16,471 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:36:30,806 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (and (<= 2 .cse2) (exists ((|ULTIMATE.start_main_~j~0#1| Int)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| 12)) 0))) (= .cse2 0))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 5 (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4)) (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 2 (select .cse3 4)))) is different from false [2022-07-19 09:36:39,654 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (forall ((|ULTIMATE.start_main_~j~0#1| Int) (v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (|v_ULTIMATE.start_main_~j~0#1_48| Int) (v_ArrVal_164 Int) (|v_ULTIMATE.start_main_~i~0#1_55| Int)) (let ((.cse2 (select (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* 12 |c_ULTIMATE.start_main_~i~0#1|)) 0) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse3 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (= .cse2 0) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|))))) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (or (let ((.cse4 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 12 |c_ULTIMATE.start_main_~i~0#1|)))) (and (= (select .cse1 .cse4) 0) (= .cse4 4))) (<= 2 (select .cse1 4))) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0))))) is different from false [2022-07-19 09:36:45,727 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (or (let ((.cse3 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) (* 12 |c_ULTIMATE.start_main_~i~0#1|)))) (and (= (select .cse2 .cse3) 0) (= .cse3 4))) (<= 2 (select .cse2 4))))) is different from false [2022-07-19 09:36:47,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_55| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_55|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse0 (select (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_55| 12))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ .cse1 |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse0 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) 4))) (or (= .cse2 0) (<= 2 .cse2))) (= (+ (- 2) |c_ULTIMATE.start_main_~MINVAL~0#1|) 0)) is different from false [2022-07-19 09:36:49,766 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|))) (and (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= 2 .cse0) (= .cse0 0))) (forall ((|v_ULTIMATE.start_main_~j~0#1_48| Int)) (or (forall ((v_ArrVal_166 Int) (|v_ULTIMATE.start_main_~j~0#1_47| Int) (v_ArrVal_164 Int)) (let ((.cse2 (select (let ((.cse3 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3 (* |v_ULTIMATE.start_main_~j~0#1_48| (- 4))) v_ArrVal_164) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse3 (* |v_ULTIMATE.start_main_~j~0#1_47| (- 4))) v_ArrVal_166)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse2) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_47| 1) |v_ULTIMATE.start_main_~j~0#1_48|)) (= .cse2 0)))) (not (<= |v_ULTIMATE.start_main_~j~0#1_48| 3)))) (= |c_ULTIMATE.start_main_~#volArray~0#1.offset| 0) (<= (+ 5 (div (+ (* (- 1) |c_ULTIMATE.start_main_~#volArray~0#1.offset|) 4) 4)) (* 3 |c_ULTIMATE.start_main_~i~0#1|)) (= 2 |c_ULTIMATE.start_main_~MINVAL~0#1|) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| 2) (<= 2 (select .cse1 4)) (exists ((|ULTIMATE.start_main_~j~0#1| Int) (|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |ULTIMATE.start_main_~j~0#1| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 12))) 0))))) is different from false [2022-07-19 09:37:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 09:37:08,330 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2022-07-19 09:37:08,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-19 09:37:08,331 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 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-19 09:37:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 09:37:08,332 INFO L225 Difference]: With dead ends: 185 [2022-07-19 09:37:08,332 INFO L226 Difference]: Without dead ends: 183 [2022-07-19 09:37:08,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 121.8s TimeCoverageRelationStatistics Valid=597, Invalid=3409, Unknown=54, NotChecked=910, Total=4970 [2022-07-19 09:37:08,334 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 09:37:08,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 355 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 276 Invalid, 0 Unknown, 387 Unchecked, 0.2s Time] [2022-07-19 09:37:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-19 09:37:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 132. [2022-07-19 09:37:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 131 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-07-19 09:37:08,353 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 43 [2022-07-19 09:37:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 09:37:08,354 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-07-19 09:37:08,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 09:37:08,354 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-07-19 09:37:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 09:37:08,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 09:37:08,355 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 09:37:08,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 09:37:08,563 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,SelfDestructingSolverStorable11 [2022-07-19 09:37:08,564 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 09:37:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 09:37:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash -611247012, now seen corresponding path program 2 times [2022-07-19 09:37:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 09:37:08,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697470247] [2022-07-19 09:37:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 09:37:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 09:37:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 09:37:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 09:37:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 09:37:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697470247] [2022-07-19 09:37:08,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697470247] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 09:37:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155264734] [2022-07-19 09:37:08,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 09:37:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 09:37:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 09:37:08,938 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 09:37:08,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 09:37:08,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 09:37:08,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 09:37:08,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-19 09:37:09,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 09:37:09,092 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 16 treesize of output 12 [2022-07-19 09:37:09,142 INFO L356 Elim1Store]: treesize reduction 40, result has 31.0 percent of original size [2022-07-19 09:37:09,142 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 31 treesize of output 36 [2022-07-19 09:37:09,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:09,292 INFO L356 Elim1Store]: treesize reduction 47, result has 35.6 percent of original size [2022-07-19 09:37:09,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2022-07-19 09:37:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:09,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2022-07-19 09:37:09,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 09:37:09,425 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 38 treesize of output 31 [2022-07-19 09:37:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 09:37:09,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 09:37:27,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_59| Int) (v_ArrVal_206 Int) (v_ArrVal_205 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| (- 4)) .cse1) v_ArrVal_205) (+ (* |v_ULTIMATE.start_main_~j~0#1_59| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_206)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_59| 1) |c_ULTIMATE.start_main_~j~0#1|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0)))) is different from false [2022-07-19 09:37:29,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_60| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_60| 1) |c_ULTIMATE.start_main_~j~0#1|)) (forall ((|v_ULTIMATE.start_main_~j~0#1_59| Int) (v_ArrVal_206 Int) (v_ArrVal_205 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_205) (+ (* |v_ULTIMATE.start_main_~j~0#1_59| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_206)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (= .cse0 0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_59| 1) |v_ULTIMATE.start_main_~j~0#1_60|))))))) is different from false [2022-07-19 09:38:07,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~j~0#1_61| Int)) (or (not (<= |v_ULTIMATE.start_main_~j~0#1_61| 3)) (forall ((v_ArrVal_203 Int) (|v_ULTIMATE.start_main_~j~0#1_59| Int) (|v_ULTIMATE.start_main_~j~0#1_60| Int) (v_ArrVal_206 Int) (v_ArrVal_205 Int)) (let ((.cse0 (select (let ((.cse1 (* 12 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#volArray~0#1.base|) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1 (* |v_ULTIMATE.start_main_~j~0#1_61| (- 4))) v_ArrVal_203) (+ (* |v_ULTIMATE.start_main_~j~0#1_60| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_205) (+ (* |v_ULTIMATE.start_main_~j~0#1_59| (- 4)) |c_ULTIMATE.start_main_~#volArray~0#1.offset| .cse1) v_ArrVal_206)) (+ |c_ULTIMATE.start_main_~#volArray~0#1.offset| 4)))) (or (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_60| 1) |v_ULTIMATE.start_main_~j~0#1_61|)) (<= |c_ULTIMATE.start_main_~MINVAL~0#1| .cse0) (not (<= (+ |v_ULTIMATE.start_main_~j~0#1_59| 1) |v_ULTIMATE.start_main_~j~0#1_60|)) (= .cse0 0)))))) is different from false