./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 05:25:59,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 05:25:59,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 05:25:59,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 05:25:59,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 05:25:59,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 05:25:59,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 05:25:59,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 05:25:59,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 05:25:59,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 05:25:59,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 05:25:59,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 05:25:59,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 05:25:59,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 05:25:59,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 05:25:59,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 05:25:59,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 05:25:59,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 05:25:59,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 05:25:59,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 05:25:59,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 05:25:59,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 05:25:59,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 05:25:59,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 05:25:59,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 05:25:59,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 05:25:59,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 05:25:59,774 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 05:25:59,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 05:25:59,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 05:25:59,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 05:25:59,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 05:25:59,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 05:25:59,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 05:25:59,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 05:25:59,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 05:25:59,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 05:25:59,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 05:25:59,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 05:25:59,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 05:25:59,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 05:25:59,783 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 05:25:59,805 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 05:25:59,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 05:25:59,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 05:25:59,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 05:25:59,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 05:25:59,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 05:25:59,810 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 05:25:59,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 05:25:59,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 05:25:59,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 05:25:59,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 05:25:59,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 05:25:59,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 05:25:59,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 05:25:59,813 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 05:25:59,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 05:25:59,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 05:25:59,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 05:25:59,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 05:25:59,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 05:25:59,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 05:25:59,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 05:25:59,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 05:25:59,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 05:25:59,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 05:25:59,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 05:25:59,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 05:25:59,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 05:25:59,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 05:25:59,816 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2021-11-04 05:26:00,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 05:26:00,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 05:26:00,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 05:26:00,083 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 05:26:00,085 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 05:26:00,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-04 05:26:00,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08f84f40/259c91cb51f84740a5f2ab38918a55e9/FLAG512fd9115 [2021-11-04 05:26:00,807 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 05:26:00,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-04 05:26:00,849 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08f84f40/259c91cb51f84740a5f2ab38918a55e9/FLAG512fd9115 [2021-11-04 05:26:00,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08f84f40/259c91cb51f84740a5f2ab38918a55e9 [2021-11-04 05:26:00,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 05:26:00,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 05:26:00,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 05:26:00,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 05:26:00,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 05:26:00,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 05:26:00" (1/1) ... [2021-11-04 05:26:00,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13deccbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:00, skipping insertion in model container [2021-11-04 05:26:00,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 05:26:00" (1/1) ... [2021-11-04 05:26:00,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 05:26:01,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 05:26:02,352 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-11-04 05:26:02,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 05:26:02,394 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 05:26:02,611 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-11-04 05:26:02,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 05:26:02,721 INFO L208 MainTranslator]: Completed translation [2021-11-04 05:26:02,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02 WrapperNode [2021-11-04 05:26:02,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 05:26:02,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 05:26:02,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 05:26:02,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 05:26:02,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:02,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:02,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 05:26:02,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 05:26:02,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 05:26:02,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 05:26:02,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:02,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 05:26:03,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 05:26:03,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 05:26:03,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 05:26:03,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (1/1) ... [2021-11-04 05:26:03,345 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 05:26:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:26:03,368 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) [2021-11-04 05:26:03,395 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 [2021-11-04 05:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 05:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-04 05:26:03,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 05:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 05:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 05:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 05:26:03,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 05:26:03,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 05:26:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 05:26:03,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 05:26:03,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 05:26:05,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 05:26:05,446 INFO L299 CfgBuilder]: Removed 1734 assume(true) statements. [2021-11-04 05:26:05,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 05:26:05 BoogieIcfgContainer [2021-11-04 05:26:05,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 05:26:05,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 05:26:05,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 05:26:05,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 05:26:05,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 05:26:00" (1/3) ... [2021-11-04 05:26:05,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea1cad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 05:26:05, skipping insertion in model container [2021-11-04 05:26:05,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 05:26:02" (2/3) ... [2021-11-04 05:26:05,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea1cad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 05:26:05, skipping insertion in model container [2021-11-04 05:26:05,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 05:26:05" (3/3) ... [2021-11-04 05:26:05,457 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-11-04 05:26:05,464 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 05:26:05,464 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-04 05:26:05,521 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 05:26:05,528 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-04 05:26:05,528 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-04 05:26:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 1834 states, 1832 states have (on average 1.4939956331877728) internal successors, (2737), 1833 states have internal predecessors, (2737), 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) [2021-11-04 05:26:05,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 05:26:05,597 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:05,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:05,598 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1253874950, now seen corresponding path program 1 times [2021-11-04 05:26:05,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:05,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252832299] [2021-11-04 05:26:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:05,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 05:26:05,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:05,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252832299] [2021-11-04 05:26:05,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252832299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:26:05,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:26:05,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 05:26:06,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410027227] [2021-11-04 05:26:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:26:06,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-04 05:26:06,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:06,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-04 05:26:06,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-04 05:26:06,033 INFO L87 Difference]: Start difference. First operand has 1834 states, 1832 states have (on average 1.4939956331877728) internal successors, (2737), 1833 states have internal predecessors, (2737), 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 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 05:26:09,475 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:11,697 INFO L93 Difference]: Finished difference Result 3664 states and 5469 transitions. [2021-11-04 05:26:11,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-04 05:26:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-04 05:26:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:11,722 INFO L225 Difference]: With dead ends: 3664 [2021-11-04 05:26:11,722 INFO L226 Difference]: Without dead ends: 1799 [2021-11-04 05:26:11,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-04 05:26:11,732 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4911.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.71ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5510.35ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:11,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 2707 Unknown, 0 Unchecked, 6.71ms Time], IncrementalHoareTripleChecker [0 Valid, 2706 Invalid, 1 Unknown, 0 Unchecked, 5510.35ms Time] [2021-11-04 05:26:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2021-11-04 05:26:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2021-11-04 05:26:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1798 states have (on average 1.4799777530589544) internal successors, (2661), 1798 states have internal predecessors, (2661), 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) [2021-11-04 05:26:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2661 transitions. [2021-11-04 05:26:11,841 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2661 transitions. Word has length 65 [2021-11-04 05:26:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:11,842 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2661 transitions. [2021-11-04 05:26:11,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 05:26:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2661 transitions. [2021-11-04 05:26:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-04 05:26:11,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:11,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:11,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 05:26:11,846 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1631549198, now seen corresponding path program 1 times [2021-11-04 05:26:11,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:11,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987649859] [2021-11-04 05:26:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:11,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 05:26:11,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:11,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987649859] [2021-11-04 05:26:11,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987649859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:26:11,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:26:11,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:26:11,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156198925] [2021-11-04 05:26:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:26:11,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:26:11,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:26:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:11,973 INFO L87 Difference]: Start difference. First operand 1799 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 05:26:15,415 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:16,795 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:18,013 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:20,845 INFO L93 Difference]: Finished difference Result 3571 states and 5297 transitions. [2021-11-04 05:26:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:26:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-04 05:26:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:20,854 INFO L225 Difference]: With dead ends: 3571 [2021-11-04 05:26:20,854 INFO L226 Difference]: Without dead ends: 1804 [2021-11-04 05:26:20,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.80ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:20,859 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 5317 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8023.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.70ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8747.89ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:20,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 5325 Unknown, 0 Unchecked, 11.70ms Time], IncrementalHoareTripleChecker [8 Valid, 5317 Invalid, 0 Unknown, 0 Unchecked, 8747.89ms Time] [2021-11-04 05:26:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2021-11-04 05:26:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2021-11-04 05:26:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.478646699944537) internal successors, (2666), 1803 states have internal predecessors, (2666), 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) [2021-11-04 05:26:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2666 transitions. [2021-11-04 05:26:20,979 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2666 transitions. Word has length 65 [2021-11-04 05:26:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:20,980 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2666 transitions. [2021-11-04 05:26:20,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 05:26:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2666 transitions. [2021-11-04 05:26:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-04 05:26:20,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:20,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:20,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 05:26:20,988 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1085390983, now seen corresponding path program 1 times [2021-11-04 05:26:20,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:20,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989550556] [2021-11-04 05:26:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:20,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-04 05:26:21,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:21,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989550556] [2021-11-04 05:26:21,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989550556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:26:21,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:26:21,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:26:21,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526048983] [2021-11-04 05:26:21,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:26:21,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:26:21,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:21,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:26:21,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:21,129 INFO L87 Difference]: Start difference. First operand 1804 states and 2666 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2021-11-04 05:26:24,293 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:27,965 INFO L93 Difference]: Finished difference Result 3570 states and 5291 transitions. [2021-11-04 05:26:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:26:27,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2021-11-04 05:26:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:27,976 INFO L225 Difference]: With dead ends: 3570 [2021-11-04 05:26:27,976 INFO L226 Difference]: Without dead ends: 1806 [2021-11-04 05:26:27,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.35ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:27,980 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 5318 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6051.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.35ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5318 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6751.14ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:27,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 5321 Unknown, 0 Unchecked, 8.35ms Time], IncrementalHoareTripleChecker [2 Valid, 5318 Invalid, 1 Unknown, 0 Unchecked, 6751.14ms Time] [2021-11-04 05:26:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2021-11-04 05:26:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1806. [2021-11-04 05:26:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1805 states have (on average 1.4781163434903046) internal successors, (2668), 1805 states have internal predecessors, (2668), 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) [2021-11-04 05:26:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2668 transitions. [2021-11-04 05:26:28,017 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2668 transitions. Word has length 70 [2021-11-04 05:26:28,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:28,017 INFO L470 AbstractCegarLoop]: Abstraction has 1806 states and 2668 transitions. [2021-11-04 05:26:28,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2021-11-04 05:26:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2668 transitions. [2021-11-04 05:26:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-04 05:26:28,019 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:28,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:28,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 05:26:28,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1738638429, now seen corresponding path program 1 times [2021-11-04 05:26:28,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:28,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082282756] [2021-11-04 05:26:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:28,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:28,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-04 05:26:28,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:28,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082282756] [2021-11-04 05:26:28,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082282756] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:26:28,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:26:28,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:26:28,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769927094] [2021-11-04 05:26:28,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:26:28,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:26:28,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:26:28,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:28,134 INFO L87 Difference]: Start difference. First operand 1806 states and 2668 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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) [2021-11-04 05:26:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:34,327 INFO L93 Difference]: Finished difference Result 4409 states and 6513 transitions. [2021-11-04 05:26:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:26:34,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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 72 [2021-11-04 05:26:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:34,340 INFO L225 Difference]: With dead ends: 4409 [2021-11-04 05:26:34,341 INFO L226 Difference]: Without dead ends: 2662 [2021-11-04 05:26:34,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.67ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:34,346 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1297 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5342.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.75ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6091.45ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:34,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1297 Valid, 0 Invalid, 5262 Unknown, 0 Unchecked, 9.75ms Time], IncrementalHoareTripleChecker [2 Valid, 5260 Invalid, 0 Unknown, 0 Unchecked, 6091.45ms Time] [2021-11-04 05:26:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2021-11-04 05:26:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2021-11-04 05:26:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4701240135287486) internal successors, (3912), 2661 states have internal predecessors, (3912), 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) [2021-11-04 05:26:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3912 transitions. [2021-11-04 05:26:34,405 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3912 transitions. Word has length 72 [2021-11-04 05:26:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:34,405 INFO L470 AbstractCegarLoop]: Abstraction has 2662 states and 3912 transitions. [2021-11-04 05:26:34,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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) [2021-11-04 05:26:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3912 transitions. [2021-11-04 05:26:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-04 05:26:34,409 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:34,409 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:34,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-04 05:26:34,409 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:34,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1289383257, now seen corresponding path program 1 times [2021-11-04 05:26:34,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:34,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523464565] [2021-11-04 05:26:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:34,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-04 05:26:34,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:34,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523464565] [2021-11-04 05:26:34,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523464565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:26:34,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:26:34,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 05:26:34,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278313823] [2021-11-04 05:26:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:26:34,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:26:34,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:26:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:34,569 INFO L87 Difference]: Start difference. First operand 2662 states and 3912 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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) [2021-11-04 05:26:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:37,653 INFO L93 Difference]: Finished difference Result 5265 states and 7756 transitions. [2021-11-04 05:26:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:26:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2021-11-04 05:26:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:37,667 INFO L225 Difference]: With dead ends: 5265 [2021-11-04 05:26:37,667 INFO L226 Difference]: Without dead ends: 2662 [2021-11-04 05:26:37,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.71ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:26:37,671 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2597 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2660 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2527.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.07ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2991.82ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:37,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2597 Valid, 0 Invalid, 2660 Unknown, 0 Unchecked, 3.07ms Time], IncrementalHoareTripleChecker [0 Valid, 2660 Invalid, 0 Unknown, 0 Unchecked, 2991.82ms Time] [2021-11-04 05:26:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2021-11-04 05:26:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2021-11-04 05:26:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4693724163848176) internal successors, (3910), 2661 states have internal predecessors, (3910), 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) [2021-11-04 05:26:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3910 transitions. [2021-11-04 05:26:37,731 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3910 transitions. Word has length 100 [2021-11-04 05:26:37,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:37,732 INFO L470 AbstractCegarLoop]: Abstraction has 2662 states and 3910 transitions. [2021-11-04 05:26:37,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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) [2021-11-04 05:26:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3910 transitions. [2021-11-04 05:26:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-04 05:26:37,735 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:37,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:37,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 05:26:37,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1948914779, now seen corresponding path program 1 times [2021-11-04 05:26:37,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:37,737 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959264586] [2021-11-04 05:26:37,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:37,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-04 05:26:37,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:37,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959264586] [2021-11-04 05:26:37,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959264586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:26:37,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:26:37,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 05:26:37,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080751803] [2021-11-04 05:26:37,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:26:37,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 05:26:37,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:37,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 05:26:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 05:26:37,851 INFO L87 Difference]: Start difference. First operand 2662 states and 3910 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-11-04 05:26:41,375 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:43,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:26:47,051 INFO L93 Difference]: Finished difference Result 5269 states and 7756 transitions. [2021-11-04 05:26:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 05:26:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 100 [2021-11-04 05:26:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:26:47,062 INFO L225 Difference]: With dead ends: 5269 [2021-11-04 05:26:47,062 INFO L226 Difference]: Without dead ends: 2662 [2021-11-04 05:26:47,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 05:26:47,066 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 5311 mSDsCounter, 0 mSdLazyCounter, 7979 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8282.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.79ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9091.64ms IncrementalHoareTripleChecker+Time [2021-11-04 05:26:47,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 7979 Unknown, 0 Unchecked, 8.79ms Time], IncrementalHoareTripleChecker [0 Valid, 7979 Invalid, 0 Unknown, 0 Unchecked, 9091.64ms Time] [2021-11-04 05:26:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2021-11-04 05:26:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2021-11-04 05:26:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.468620819240887) internal successors, (3908), 2661 states have internal predecessors, (3908), 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) [2021-11-04 05:26:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3908 transitions. [2021-11-04 05:26:47,117 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3908 transitions. Word has length 100 [2021-11-04 05:26:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:26:47,117 INFO L470 AbstractCegarLoop]: Abstraction has 2662 states and 3908 transitions. [2021-11-04 05:26:47,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-11-04 05:26:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3908 transitions. [2021-11-04 05:26:47,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-04 05:26:47,120 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:26:47,120 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:26:47,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 05:26:47,121 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:26:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:26:47,121 INFO L85 PathProgramCache]: Analyzing trace with hash -343819490, now seen corresponding path program 1 times [2021-11-04 05:26:47,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:26:47,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869967028] [2021-11-04 05:26:47,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:47,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:26:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:26:47,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:26:47,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869967028] [2021-11-04 05:26:47,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869967028] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:26:47,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195644516] [2021-11-04 05:26:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:26:47,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:26:47,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:26:47,243 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) [2021-11-04 05:26:47,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-04 05:26:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:26:47,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-04 05:26:47,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:26:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:26:47,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 05:26:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 05:26:48,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195644516] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 05:26:48,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 05:26:48,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-04 05:26:48,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356416397] [2021-11-04 05:26:48,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 05:26:48,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 05:26:48,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:26:48,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 05:26:48,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 05:26:48,168 INFO L87 Difference]: Start difference. First operand 2662 states and 3908 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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) [2021-11-04 05:26:50,500 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:53,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:54,964 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:56,471 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:26:58,444 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:00,042 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:27:05,316 INFO L93 Difference]: Finished difference Result 5312 states and 7822 transitions. [2021-11-04 05:27:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 05:27:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 103 [2021-11-04 05:27:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:27:05,325 INFO L225 Difference]: With dead ends: 5312 [2021-11-04 05:27:05,325 INFO L226 Difference]: Without dead ends: 2683 [2021-11-04 05:27:05,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.36ms TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 05:27:05,330 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 10552 mSDsCounter, 0 mSdLazyCounter, 13285 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15789.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.07ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 13285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17019.43ms IncrementalHoareTripleChecker+Time [2021-11-04 05:27:05,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 13340 Unknown, 0 Unchecked, 16.07ms Time], IncrementalHoareTripleChecker [55 Valid, 13285 Invalid, 0 Unknown, 0 Unchecked, 17019.43ms Time] [2021-11-04 05:27:05,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2021-11-04 05:27:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2683. [2021-11-04 05:27:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2683 states, 2682 states have (on average 1.464951528709918) internal successors, (3929), 2682 states have internal predecessors, (3929), 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) [2021-11-04 05:27:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 3929 transitions. [2021-11-04 05:27:05,383 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 3929 transitions. Word has length 103 [2021-11-04 05:27:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:27:05,384 INFO L470 AbstractCegarLoop]: Abstraction has 2683 states and 3929 transitions. [2021-11-04 05:27:05,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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) [2021-11-04 05:27:05,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3929 transitions. [2021-11-04 05:27:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-04 05:27:05,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:27:05,387 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:27:05,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-04 05:27:05,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:27:05,608 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:27:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:27:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1433033897, now seen corresponding path program 2 times [2021-11-04 05:27:05,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:27:05,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32391627] [2021-11-04 05:27:05,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:27:05,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:27:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:27:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-04 05:27:05,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:27:05,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32391627] [2021-11-04 05:27:05,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32391627] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:27:05,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861876546] [2021-11-04 05:27:05,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-04 05:27:05,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:27:05,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:27:05,789 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) [2021-11-04 05:27:05,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-04 05:27:06,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-04 05:27:06,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-04 05:27:06,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-04 05:27:06,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:27:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-04 05:27:06,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 05:27:06,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861876546] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:27:06,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 05:27:06,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-11-04 05:27:06,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238892199] [2021-11-04 05:27:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:27:06,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 05:27:06,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:27:06,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 05:27:06,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-04 05:27:06,463 INFO L87 Difference]: Start difference. First operand 2683 states and 3929 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-11-04 05:27:09,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:27:17,751 INFO L93 Difference]: Finished difference Result 5286 states and 7769 transitions. [2021-11-04 05:27:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 05:27:17,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 124 [2021-11-04 05:27:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:27:17,765 INFO L225 Difference]: With dead ends: 5286 [2021-11-04 05:27:17,765 INFO L226 Difference]: Without dead ends: 5284 [2021-11-04 05:27:17,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 37.46ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-11-04 05:27:17,767 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4933 mSDsluCounter, 5556 mSDsCounter, 0 mSdLazyCounter, 10815 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9902.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4933 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 10817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.81ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10815 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11117.52ms IncrementalHoareTripleChecker+Time [2021-11-04 05:27:17,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4933 Valid, 0 Invalid, 10817 Unknown, 0 Unchecked, 20.81ms Time], IncrementalHoareTripleChecker [1 Valid, 10815 Invalid, 1 Unknown, 0 Unchecked, 11117.52ms Time] [2021-11-04 05:27:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2021-11-04 05:27:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 2685. [2021-11-04 05:27:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2684 states have (on average 1.4646050670640836) internal successors, (3931), 2684 states have internal predecessors, (3931), 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) [2021-11-04 05:27:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3931 transitions. [2021-11-04 05:27:17,847 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3931 transitions. Word has length 124 [2021-11-04 05:27:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:27:17,848 INFO L470 AbstractCegarLoop]: Abstraction has 2685 states and 3931 transitions. [2021-11-04 05:27:17,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-11-04 05:27:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3931 transitions. [2021-11-04 05:27:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-04 05:27:17,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:27:17,852 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:27:17,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-04 05:27:18,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-04 05:27:18,078 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:27:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:27:18,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1887668944, now seen corresponding path program 1 times [2021-11-04 05:27:18,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:27:18,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587354540] [2021-11-04 05:27:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:27:18,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:27:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:27:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-04 05:27:18,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:27:18,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587354540] [2021-11-04 05:27:18,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587354540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:27:18,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:27:18,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:27:18,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231368500] [2021-11-04 05:27:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:27:18,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 05:27:18,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:27:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 05:27:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 05:27:18,247 INFO L87 Difference]: Start difference. First operand 2685 states and 3931 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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) [2021-11-04 05:27:21,071 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:23,184 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:27,884 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:29,970 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:27:31,891 INFO L93 Difference]: Finished difference Result 7895 states and 11615 transitions. [2021-11-04 05:27:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 05:27:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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 131 [2021-11-04 05:27:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:27:31,909 INFO L225 Difference]: With dead ends: 7895 [2021-11-04 05:27:31,909 INFO L226 Difference]: Without dead ends: 5290 [2021-11-04 05:27:31,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.52ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 05:27:31,916 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5403 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 7666 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12335.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5403 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.75ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13428.69ms IncrementalHoareTripleChecker+Time [2021-11-04 05:27:31,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5403 Valid, 0 Invalid, 7667 Unknown, 0 Unchecked, 11.75ms Time], IncrementalHoareTripleChecker [1 Valid, 7666 Invalid, 0 Unknown, 0 Unchecked, 13428.69ms Time] [2021-11-04 05:27:31,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2021-11-04 05:27:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 2686. [2021-11-04 05:27:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2686 states, 2685 states have (on average 1.4644320297951583) internal successors, (3932), 2685 states have internal predecessors, (3932), 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) [2021-11-04 05:27:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2686 states and 3932 transitions. [2021-11-04 05:27:32,022 INFO L78 Accepts]: Start accepts. Automaton has 2686 states and 3932 transitions. Word has length 131 [2021-11-04 05:27:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:27:32,022 INFO L470 AbstractCegarLoop]: Abstraction has 2686 states and 3932 transitions. [2021-11-04 05:27:32,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 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) [2021-11-04 05:27:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3932 transitions. [2021-11-04 05:27:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-04 05:27:32,028 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:27:32,028 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:27:32,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 05:27:32,028 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:27:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:27:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash 792091247, now seen corresponding path program 1 times [2021-11-04 05:27:32,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:27:32,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474286768] [2021-11-04 05:27:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:27:32,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:27:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:27:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-04 05:27:32,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:27:32,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474286768] [2021-11-04 05:27:32,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474286768] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:27:32,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948427620] [2021-11-04 05:27:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:27:32,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:27:32,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:27:32,226 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) [2021-11-04 05:27:32,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-04 05:27:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:27:32,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-04 05:27:32,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:27:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-04 05:27:33,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 05:27:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-04 05:27:33,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948427620] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 05:27:33,294 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 05:27:33,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2021-11-04 05:27:33,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601721152] [2021-11-04 05:27:33,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 05:27:33,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-04 05:27:33,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:27:33,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-04 05:27:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=148, Unknown=0, NotChecked=0, Total=272 [2021-11-04 05:27:33,296 INFO L87 Difference]: Start difference. First operand 2686 states and 3932 transitions. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 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) [2021-11-04 05:27:36,316 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:27:41,925 INFO L93 Difference]: Finished difference Result 5330 states and 7825 transitions. [2021-11-04 05:27:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-04 05:27:41,926 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 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 133 [2021-11-04 05:27:41,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:27:41,933 INFO L225 Difference]: With dead ends: 5330 [2021-11-04 05:27:41,933 INFO L226 Difference]: Without dead ends: 2694 [2021-11-04 05:27:41,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 130.39ms TimeCoverageRelationStatistics Valid=124, Invalid=148, Unknown=0, NotChecked=0, Total=272 [2021-11-04 05:27:41,938 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 5276 mSDsCounter, 0 mSdLazyCounter, 8017 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7613.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.34ms SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 8017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8446.96ms IncrementalHoareTripleChecker+Time [2021-11-04 05:27:41,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 8081 Unknown, 0 Unchecked, 9.34ms Time], IncrementalHoareTripleChecker [64 Valid, 8017 Invalid, 0 Unknown, 0 Unchecked, 8446.96ms Time] [2021-11-04 05:27:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2021-11-04 05:27:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2694. [2021-11-04 05:27:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.4630523579650947) internal successors, (3940), 2693 states have internal predecessors, (3940), 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) [2021-11-04 05:27:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3940 transitions. [2021-11-04 05:27:42,021 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 3940 transitions. Word has length 133 [2021-11-04 05:27:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:27:42,021 INFO L470 AbstractCegarLoop]: Abstraction has 2694 states and 3940 transitions. [2021-11-04 05:27:42,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 17 states have internal predecessors, (124), 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) [2021-11-04 05:27:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3940 transitions. [2021-11-04 05:27:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-11-04 05:27:42,027 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:27:42,027 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:27:42,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-04 05:27:42,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:27:42,248 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:27:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:27:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1700478191, now seen corresponding path program 2 times [2021-11-04 05:27:42,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:27:42,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693717556] [2021-11-04 05:27:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:27:42,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:27:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:27:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:27:42,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:27:42,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693717556] [2021-11-04 05:27:42,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693717556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:27:42,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:27:42,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 05:27:42,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465809823] [2021-11-04 05:27:42,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:27:42,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 05:27:42,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:27:42,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 05:27:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 05:27:42,398 INFO L87 Difference]: Start difference. First operand 2694 states and 3940 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2021-11-04 05:27:45,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:47,054 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:49,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:51,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:27:53,590 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:00,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:28:10,802 INFO L93 Difference]: Finished difference Result 10167 states and 14968 transitions. [2021-11-04 05:28:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 05:28:10,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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 141 [2021-11-04 05:28:10,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:28:10,821 INFO L225 Difference]: With dead ends: 10167 [2021-11-04 05:28:10,822 INFO L226 Difference]: Without dead ends: 10165 [2021-11-04 05:28:10,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 24.34ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 05:28:10,824 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9787 mSDsluCounter, 15148 mSDsCounter, 0 mSdLazyCounter, 22784 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25458.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9787 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.48ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22784 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27950.22ms IncrementalHoareTripleChecker+Time [2021-11-04 05:28:10,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9787 Valid, 0 Invalid, 22788 Unknown, 0 Unchecked, 34.48ms Time], IncrementalHoareTripleChecker [2 Valid, 22784 Invalid, 2 Unknown, 0 Unchecked, 27950.22ms Time] [2021-11-04 05:28:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10165 states. [2021-11-04 05:28:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10165 to 2695. [2021-11-04 05:28:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2694 states have (on average 1.4628804751299183) internal successors, (3941), 2694 states have internal predecessors, (3941), 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) [2021-11-04 05:28:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3941 transitions. [2021-11-04 05:28:10,946 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3941 transitions. Word has length 141 [2021-11-04 05:28:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:28:10,946 INFO L470 AbstractCegarLoop]: Abstraction has 2695 states and 3941 transitions. [2021-11-04 05:28:10,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 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) [2021-11-04 05:28:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3941 transitions. [2021-11-04 05:28:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-11-04 05:28:10,952 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:28:10,952 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:28:10,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 05:28:10,952 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:28:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:28:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash 44949227, now seen corresponding path program 1 times [2021-11-04 05:28:10,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:28:10,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429736121] [2021-11-04 05:28:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:28:10,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:28:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:28:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:28:11,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:28:11,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429736121] [2021-11-04 05:28:11,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429736121] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:28:11,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:28:11,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:28:11,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283644639] [2021-11-04 05:28:11,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:28:11,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:28:11,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:28:11,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:28:11,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:28:11,118 INFO L87 Difference]: Start difference. First operand 2695 states and 3941 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) [2021-11-04 05:28:14,226 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:28:19,171 INFO L93 Difference]: Finished difference Result 6151 states and 9018 transitions. [2021-11-04 05:28:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:28:19,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 155 [2021-11-04 05:28:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:28:19,178 INFO L225 Difference]: With dead ends: 6151 [2021-11-04 05:28:19,178 INFO L226 Difference]: Without dead ends: 3544 [2021-11-04 05:28:19,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.82ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:28:19,183 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2557 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 5186 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7051.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2557 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.83ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7870.51ms IncrementalHoareTripleChecker+Time [2021-11-04 05:28:19,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2557 Valid, 0 Invalid, 5186 Unknown, 0 Unchecked, 5.83ms Time], IncrementalHoareTripleChecker [0 Valid, 5186 Invalid, 0 Unknown, 0 Unchecked, 7870.51ms Time] [2021-11-04 05:28:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2021-11-04 05:28:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 2695. [2021-11-04 05:28:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2694 states have (on average 1.4625092798812176) internal successors, (3940), 2694 states have internal predecessors, (3940), 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) [2021-11-04 05:28:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3940 transitions. [2021-11-04 05:28:19,305 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3940 transitions. Word has length 155 [2021-11-04 05:28:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:28:19,305 INFO L470 AbstractCegarLoop]: Abstraction has 2695 states and 3940 transitions. [2021-11-04 05:28:19,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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) [2021-11-04 05:28:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3940 transitions. [2021-11-04 05:28:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-04 05:28:19,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:28:19,311 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:28:19,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 05:28:19,311 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:28:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:28:19,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1493357201, now seen corresponding path program 1 times [2021-11-04 05:28:19,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:28:19,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392951395] [2021-11-04 05:28:19,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:28:19,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:28:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:28:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:28:19,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:28:19,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392951395] [2021-11-04 05:28:19,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392951395] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:28:19,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:28:19,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:28:19,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682211738] [2021-11-04 05:28:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:28:19,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 05:28:19,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:28:19,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 05:28:19,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 05:28:19,496 INFO L87 Difference]: Start difference. First operand 2695 states and 3940 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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) [2021-11-04 05:28:25,026 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:28:31,192 INFO L93 Difference]: Finished difference Result 7908 states and 11625 transitions. [2021-11-04 05:28:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 05:28:31,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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 157 [2021-11-04 05:28:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:28:31,203 INFO L225 Difference]: With dead ends: 7908 [2021-11-04 05:28:31,204 INFO L226 Difference]: Without dead ends: 5301 [2021-11-04 05:28:31,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.37ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 05:28:31,208 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 5171 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 7881 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10370.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.01ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7881 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11427.21ms IncrementalHoareTripleChecker+Time [2021-11-04 05:28:31,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5171 Valid, 0 Invalid, 7884 Unknown, 0 Unchecked, 11.01ms Time], IncrementalHoareTripleChecker [2 Valid, 7881 Invalid, 1 Unknown, 0 Unchecked, 11427.21ms Time] [2021-11-04 05:28:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2021-11-04 05:28:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 2699. [2021-11-04 05:28:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 1.4621942179392142) internal successors, (3945), 2698 states have internal predecessors, (3945), 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) [2021-11-04 05:28:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3945 transitions. [2021-11-04 05:28:31,338 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3945 transitions. Word has length 157 [2021-11-04 05:28:31,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:28:31,339 INFO L470 AbstractCegarLoop]: Abstraction has 2699 states and 3945 transitions. [2021-11-04 05:28:31,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 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) [2021-11-04 05:28:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3945 transitions. [2021-11-04 05:28:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-04 05:28:31,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:28:31,345 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:28:31,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-04 05:28:31,345 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:28:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:28:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1712866833, now seen corresponding path program 1 times [2021-11-04 05:28:31,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:28:31,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698817416] [2021-11-04 05:28:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:28:31,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:28:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:28:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-11-04 05:28:31,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:28:31,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698817416] [2021-11-04 05:28:31,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698817416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:28:31,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:28:31,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:28:31,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526949636] [2021-11-04 05:28:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:28:31,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:28:31,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:28:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:28:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:28:31,451 INFO L87 Difference]: Start difference. First operand 2699 states and 3945 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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) [2021-11-04 05:28:34,023 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:36,441 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:28:40,604 INFO L93 Difference]: Finished difference Result 5337 states and 7820 transitions. [2021-11-04 05:28:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:28:40,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 160 [2021-11-04 05:28:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:28:40,609 INFO L225 Difference]: With dead ends: 5337 [2021-11-04 05:28:40,609 INFO L226 Difference]: Without dead ends: 2726 [2021-11-04 05:28:40,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:28:40,613 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 103 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8308.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.82ms SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8963.26ms IncrementalHoareTripleChecker+Time [2021-11-04 05:28:40,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 5296 Unknown, 0 Unchecked, 5.82ms Time], IncrementalHoareTripleChecker [103 Valid, 5191 Invalid, 2 Unknown, 0 Unchecked, 8963.26ms Time] [2021-11-04 05:28:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2021-11-04 05:28:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2699. [2021-11-04 05:28:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2698 states have (on average 1.4321719792438843) internal successors, (3864), 2698 states have internal predecessors, (3864), 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) [2021-11-04 05:28:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3864 transitions. [2021-11-04 05:28:40,746 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3864 transitions. Word has length 160 [2021-11-04 05:28:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:28:40,747 INFO L470 AbstractCegarLoop]: Abstraction has 2699 states and 3864 transitions. [2021-11-04 05:28:40,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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) [2021-11-04 05:28:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3864 transitions. [2021-11-04 05:28:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-04 05:28:40,760 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:28:40,760 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:28:40,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 05:28:40,760 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:28:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:28:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -618587703, now seen corresponding path program 1 times [2021-11-04 05:28:40,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:28:40,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774281001] [2021-11-04 05:28:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:28:40,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:28:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:28:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:28:41,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:28:41,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774281001] [2021-11-04 05:28:41,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774281001] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:28:41,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545597386] [2021-11-04 05:28:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:28:41,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:28:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:28:41,015 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) [2021-11-04 05:28:41,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-04 05:28:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:28:41,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 05:28:41,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:28:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:28:41,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 05:28:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:28:42,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545597386] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 05:28:42,190 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 05:28:42,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-04 05:28:42,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824383350] [2021-11-04 05:28:42,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 05:28:42,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 05:28:42,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:28:42,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 05:28:42,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-04 05:28:42,192 INFO L87 Difference]: Start difference. First operand 2699 states and 3864 transitions. Second operand has 10 states, 10 states have (on average 24.7) internal successors, (247), 9 states have internal predecessors, (247), 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) [2021-11-04 05:28:46,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:49,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:28:56,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:02,472 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:05,844 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:08,456 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:29:15,178 INFO L93 Difference]: Finished difference Result 15710 states and 22642 transitions. [2021-11-04 05:29:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 05:29:15,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.7) internal successors, (247), 9 states have internal predecessors, (247), 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 163 [2021-11-04 05:29:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:29:15,198 INFO L225 Difference]: With dead ends: 15710 [2021-11-04 05:29:15,199 INFO L226 Difference]: Without dead ends: 13099 [2021-11-04 05:29:15,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 44.87ms TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-04 05:29:15,205 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 20346 mSDsluCounter, 17876 mSDsCounter, 0 mSdLazyCounter, 22888 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29181.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20346 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 22905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 54.78ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22888 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32052.57ms IncrementalHoareTripleChecker+Time [2021-11-04 05:29:15,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20346 Valid, 0 Invalid, 22905 Unknown, 0 Unchecked, 54.78ms Time], IncrementalHoareTripleChecker [16 Valid, 22888 Invalid, 1 Unknown, 0 Unchecked, 32052.57ms Time] [2021-11-04 05:29:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13099 states. [2021-11-04 05:29:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13099 to 2706. [2021-11-04 05:29:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 1.431792975970425) internal successors, (3873), 2705 states have internal predecessors, (3873), 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) [2021-11-04 05:29:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3873 transitions. [2021-11-04 05:29:15,387 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3873 transitions. Word has length 163 [2021-11-04 05:29:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:29:15,388 INFO L470 AbstractCegarLoop]: Abstraction has 2706 states and 3873 transitions. [2021-11-04 05:29:15,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.7) internal successors, (247), 9 states have internal predecessors, (247), 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) [2021-11-04 05:29:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3873 transitions. [2021-11-04 05:29:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-04 05:29:15,394 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:29:15,394 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:29:15,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-04 05:29:15,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-04 05:29:15,619 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:29:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:29:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1558820106, now seen corresponding path program 1 times [2021-11-04 05:29:15,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:29:15,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841455888] [2021-11-04 05:29:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:29:15,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:29:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:29:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:29:15,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:29:15,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841455888] [2021-11-04 05:29:15,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841455888] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:29:15,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:29:15,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-04 05:29:15,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462235008] [2021-11-04 05:29:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:29:15,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-04 05:29:15,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:29:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-04 05:29:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 05:29:15,910 INFO L87 Difference]: Start difference. First operand 2706 states and 3873 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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) [2021-11-04 05:29:18,422 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:20,091 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:22,281 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:24,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:27,302 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:29,855 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:31,053 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:36,858 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:39,216 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:43,092 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:54,351 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:29:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:29:55,886 INFO L93 Difference]: Finished difference Result 14929 states and 21428 transitions. [2021-11-04 05:29:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-04 05:29:55,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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 168 [2021-11-04 05:29:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:29:55,908 INFO L225 Difference]: With dead ends: 14929 [2021-11-04 05:29:55,908 INFO L226 Difference]: Without dead ends: 12297 [2021-11-04 05:29:55,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 98.38ms TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-11-04 05:29:55,915 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 20042 mSDsluCounter, 21969 mSDsCounter, 0 mSdLazyCounter, 27119 mSolverCounterSat, 62 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35790.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20042 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 63.21ms SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 27119 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38859.31ms IncrementalHoareTripleChecker+Time [2021-11-04 05:29:55,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20042 Valid, 0 Invalid, 27187 Unknown, 0 Unchecked, 63.21ms Time], IncrementalHoareTripleChecker [62 Valid, 27119 Invalid, 6 Unknown, 0 Unchecked, 38859.31ms Time] [2021-11-04 05:29:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2021-11-04 05:29:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 2706. [2021-11-04 05:29:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2705 states have (on average 1.4310536044362292) internal successors, (3871), 2705 states have internal predecessors, (3871), 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) [2021-11-04 05:29:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 3871 transitions. [2021-11-04 05:29:56,153 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 3871 transitions. Word has length 168 [2021-11-04 05:29:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:29:56,153 INFO L470 AbstractCegarLoop]: Abstraction has 2706 states and 3871 transitions. [2021-11-04 05:29:56,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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) [2021-11-04 05:29:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 3871 transitions. [2021-11-04 05:29:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-04 05:29:56,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:29:56,160 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:29:56,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 05:29:56,161 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:29:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:29:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash 504462482, now seen corresponding path program 1 times [2021-11-04 05:29:56,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:29:56,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745620408] [2021-11-04 05:29:56,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:29:56,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:29:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:29:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:29:56,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:29:56,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745620408] [2021-11-04 05:29:56,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745620408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:29:56,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:29:56,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 05:29:56,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372668759] [2021-11-04 05:29:56,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:29:56,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 05:29:56,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:29:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 05:29:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 05:29:56,340 INFO L87 Difference]: Start difference. First operand 2706 states and 3871 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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) [2021-11-04 05:30:01,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:08,901 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:13,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:30:19,816 INFO L93 Difference]: Finished difference Result 12621 states and 18182 transitions. [2021-11-04 05:30:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 05:30:19,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 170 [2021-11-04 05:30:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:30:19,831 INFO L225 Difference]: With dead ends: 12621 [2021-11-04 05:30:19,832 INFO L226 Difference]: Without dead ends: 10003 [2021-11-04 05:30:19,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.17ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 05:30:19,839 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9218 mSDsluCounter, 9817 mSDsCounter, 0 mSdLazyCounter, 14780 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20566.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.64ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14780 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22598.45ms IncrementalHoareTripleChecker+Time [2021-11-04 05:30:19,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9218 Valid, 0 Invalid, 14784 Unknown, 0 Unchecked, 27.64ms Time], IncrementalHoareTripleChecker [1 Valid, 14780 Invalid, 3 Unknown, 0 Unchecked, 22598.45ms Time] [2021-11-04 05:30:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10003 states. [2021-11-04 05:30:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10003 to 2708. [2021-11-04 05:30:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 1.430735131141485) internal successors, (3873), 2707 states have internal predecessors, (3873), 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) [2021-11-04 05:30:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3873 transitions. [2021-11-04 05:30:20,132 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3873 transitions. Word has length 170 [2021-11-04 05:30:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:30:20,133 INFO L470 AbstractCegarLoop]: Abstraction has 2708 states and 3873 transitions. [2021-11-04 05:30:20,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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) [2021-11-04 05:30:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3873 transitions. [2021-11-04 05:30:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-04 05:30:20,140 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:30:20,140 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:30:20,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 05:30:20,140 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:30:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:30:20,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2118943683, now seen corresponding path program 1 times [2021-11-04 05:30:20,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:30:20,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114548306] [2021-11-04 05:30:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:30:20,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:30:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:30:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:30:20,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:30:20,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114548306] [2021-11-04 05:30:20,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114548306] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:30:20,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:30:20,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 05:30:20,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767026655] [2021-11-04 05:30:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:30:20,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 05:30:20,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:30:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 05:30:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:30:20,267 INFO L87 Difference]: Start difference. First operand 2708 states and 3873 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2021-11-04 05:30:22,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:24,991 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:31,219 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:33,269 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:30:35,272 INFO L93 Difference]: Finished difference Result 7777 states and 11186 transitions. [2021-11-04 05:30:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 05:30:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 172 [2021-11-04 05:30:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:30:35,279 INFO L225 Difference]: With dead ends: 7777 [2021-11-04 05:30:35,279 INFO L226 Difference]: Without dead ends: 5157 [2021-11-04 05:30:35,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.71ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 05:30:35,282 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2334 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 7537 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13486.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.05ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7537 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14596.01ms IncrementalHoareTripleChecker+Time [2021-11-04 05:30:35,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2334 Valid, 0 Invalid, 7544 Unknown, 0 Unchecked, 8.05ms Time], IncrementalHoareTripleChecker [6 Valid, 7537 Invalid, 1 Unknown, 0 Unchecked, 14596.01ms Time] [2021-11-04 05:30:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2021-11-04 05:30:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 2710. [2021-11-04 05:30:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.4304171280915468) internal successors, (3875), 2709 states have internal predecessors, (3875), 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) [2021-11-04 05:30:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3875 transitions. [2021-11-04 05:30:35,509 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3875 transitions. Word has length 172 [2021-11-04 05:30:35,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:30:35,509 INFO L470 AbstractCegarLoop]: Abstraction has 2710 states and 3875 transitions. [2021-11-04 05:30:35,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2021-11-04 05:30:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3875 transitions. [2021-11-04 05:30:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-11-04 05:30:35,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:30:35,515 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:30:35,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-04 05:30:35,516 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:30:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:30:35,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1091896970, now seen corresponding path program 1 times [2021-11-04 05:30:35,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:30:35,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072838363] [2021-11-04 05:30:35,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:30:35,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:30:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:30:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2021-11-04 05:30:35,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:30:35,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072838363] [2021-11-04 05:30:35,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072838363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:30:35,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:30:35,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 05:30:35,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919298651] [2021-11-04 05:30:35,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:30:35,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 05:30:35,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:30:35,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 05:30:35,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 05:30:35,707 INFO L87 Difference]: Start difference. First operand 2710 states and 3875 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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) [2021-11-04 05:30:37,762 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:39,729 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:43,067 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:30:51,699 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:31:04,906 INFO L93 Difference]: Finished difference Result 17897 states and 25799 transitions. [2021-11-04 05:31:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 05:31:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 176 [2021-11-04 05:31:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:31:04,932 INFO L225 Difference]: With dead ends: 17897 [2021-11-04 05:31:04,932 INFO L226 Difference]: Without dead ends: 15275 [2021-11-04 05:31:04,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 36.41ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 05:31:04,939 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 16731 mSDsluCounter, 14991 mSDsCounter, 0 mSdLazyCounter, 21462 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24868.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 16731 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 21479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.89ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27625.69ms IncrementalHoareTripleChecker+Time [2021-11-04 05:31:04,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16731 Valid, 0 Invalid, 21479 Unknown, 0 Unchecked, 47.89ms Time], IncrementalHoareTripleChecker [16 Valid, 21462 Invalid, 1 Unknown, 0 Unchecked, 27625.69ms Time] [2021-11-04 05:31:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15275 states. [2021-11-04 05:31:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15275 to 2713. [2021-11-04 05:31:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2712 states have (on average 1.4299410029498525) internal successors, (3878), 2712 states have internal predecessors, (3878), 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) [2021-11-04 05:31:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3878 transitions. [2021-11-04 05:31:05,221 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3878 transitions. Word has length 176 [2021-11-04 05:31:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:31:05,221 INFO L470 AbstractCegarLoop]: Abstraction has 2713 states and 3878 transitions. [2021-11-04 05:31:05,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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) [2021-11-04 05:31:05,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3878 transitions. [2021-11-04 05:31:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-04 05:31:05,227 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:31:05,228 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:31:05,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-04 05:31:05,228 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:31:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:31:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash 580674734, now seen corresponding path program 1 times [2021-11-04 05:31:05,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:31:05,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887214607] [2021-11-04 05:31:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:31:05,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:31:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:31:05,811 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:31:05,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:31:05,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887214607] [2021-11-04 05:31:05,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887214607] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:31:05,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 05:31:05,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 05:31:05,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676512447] [2021-11-04 05:31:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:31:05,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 05:31:05,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:31:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 05:31:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 05:31:05,813 INFO L87 Difference]: Start difference. First operand 2713 states and 3878 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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) [2021-11-04 05:31:10,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:13,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:18,613 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:20,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:22,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:25,297 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:31:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:31:32,044 INFO L93 Difference]: Finished difference Result 7960 states and 11435 transitions. [2021-11-04 05:31:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-04 05:31:32,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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 178 [2021-11-04 05:31:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:31:32,052 INFO L225 Difference]: With dead ends: 7960 [2021-11-04 05:31:32,052 INFO L226 Difference]: Without dead ends: 5325 [2021-11-04 05:31:32,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.54ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 05:31:32,056 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2542 mSDsluCounter, 12892 mSDsCounter, 0 mSdLazyCounter, 18062 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23639.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2542 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 18064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.65ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18062 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25525.21ms IncrementalHoareTripleChecker+Time [2021-11-04 05:31:32,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2542 Valid, 0 Invalid, 18064 Unknown, 0 Unchecked, 22.65ms Time], IncrementalHoareTripleChecker [1 Valid, 18062 Invalid, 1 Unknown, 0 Unchecked, 25525.21ms Time] [2021-11-04 05:31:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-11-04 05:31:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 2713. [2021-11-04 05:31:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2712 states have (on average 1.4292035398230087) internal successors, (3876), 2712 states have internal predecessors, (3876), 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) [2021-11-04 05:31:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3876 transitions. [2021-11-04 05:31:32,315 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3876 transitions. Word has length 178 [2021-11-04 05:31:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:31:32,315 INFO L470 AbstractCegarLoop]: Abstraction has 2713 states and 3876 transitions. [2021-11-04 05:31:32,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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) [2021-11-04 05:31:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3876 transitions. [2021-11-04 05:31:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-04 05:31:32,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:31:32,320 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:31:32,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-04 05:31:32,321 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:31:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:31:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1113135887, now seen corresponding path program 1 times [2021-11-04 05:31:32,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:31:32,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672166133] [2021-11-04 05:31:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:31:32,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:31:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:31:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:31:42,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:31:42,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672166133] [2021-11-04 05:31:42,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672166133] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:31:42,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514313744] [2021-11-04 05:31:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:31:42,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:31:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:31:42,090 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) [2021-11-04 05:31:42,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-04 05:31:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:31:45,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1923 conjuncts, 128 conjunts are in the unsatisfiable core [2021-11-04 05:31:45,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:31:45,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-04 05:31:46,009 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-04 05:31:46,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-04 05:31:46,332 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-04 05:31:46,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-11-04 05:31:47,123 INFO L354 Elim1Store]: treesize reduction 144, result has 16.8 percent of original size [2021-11-04 05:31:47,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 64 [2021-11-04 05:31:47,961 INFO L354 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2021-11-04 05:31:47,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 71 [2021-11-04 05:31:48,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-04 05:31:48,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-11-04 05:31:48,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-04 05:31:48,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-04 05:31:48,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,593 INFO L388 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 29 treesize of output 13 [2021-11-04 05:31:48,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,603 INFO L388 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 29 treesize of output 13 [2021-11-04 05:31:48,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-04 05:31:48,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-11-04 05:31:48,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,761 INFO L388 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 42 treesize of output 26 [2021-11-04 05:31:48,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-04 05:31:48,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:48,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2021-11-04 05:31:49,416 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-04 05:31:49,416 INFO L388 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 3 case distinctions, treesize of input 574 treesize of output 459 [2021-11-04 05:31:50,359 INFO L354 Elim1Store]: treesize reduction 328, result has 14.4 percent of original size [2021-11-04 05:31:50,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 555 treesize of output 459 [2021-11-04 05:31:50,637 INFO L354 Elim1Store]: treesize reduction 646, result has 10.2 percent of original size [2021-11-04 05:31:50,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 416 treesize of output 414 [2021-11-04 05:31:50,723 INFO L354 Elim1Store]: treesize reduction 408, result has 11.3 percent of original size [2021-11-04 05:31:50,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 417 treesize of output 342 [2021-11-04 05:31:50,737 INFO L354 Elim1Store]: treesize reduction 84, result has 1.2 percent of original size [2021-11-04 05:31:50,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 260 treesize of output 236 [2021-11-04 05:31:50,805 INFO L354 Elim1Store]: treesize reduction 318, result has 13.6 percent of original size [2021-11-04 05:31:50,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 212 treesize of output 212 [2021-11-04 05:31:50,816 INFO L354 Elim1Store]: treesize reduction 136, result has 0.7 percent of original size [2021-11-04 05:31:50,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 197 treesize of output 161 [2021-11-04 05:31:51,477 INFO L354 Elim1Store]: treesize reduction 220, result has 13.7 percent of original size [2021-11-04 05:31:51,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 238 treesize of output 235 [2021-11-04 05:31:51,592 INFO L354 Elim1Store]: treesize reduction 210, result has 17.6 percent of original size [2021-11-04 05:31:51,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 223 treesize of output 218 [2021-11-04 05:31:51,642 INFO L354 Elim1Store]: treesize reduction 308, result has 14.0 percent of original size [2021-11-04 05:31:51,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 214 [2021-11-04 05:31:51,650 INFO L354 Elim1Store]: treesize reduction 136, result has 0.7 percent of original size [2021-11-04 05:31:51,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 199 treesize of output 195 [2021-11-04 05:31:51,997 INFO L354 Elim1Store]: treesize reduction 278, result has 15.2 percent of original size [2021-11-04 05:31:51,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 133 treesize of output 144 [2021-11-04 05:31:52,037 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:31:52,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 110 [2021-11-04 05:31:52,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:31:52,537 INFO L354 Elim1Store]: treesize reduction 396, result has 13.0 percent of original size [2021-11-04 05:31:52,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 139 treesize of output 153 [2021-11-04 05:31:52,574 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:31:52,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 125 [2021-11-04 05:31:52,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:52,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:31:54,670 INFO L354 Elim1Store]: treesize reduction 658, result has 11.7 percent of original size [2021-11-04 05:31:54,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 160 treesize of output 190 [2021-11-04 05:31:54,709 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:31:54,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 166 treesize of output 156 [2021-11-04 05:31:54,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:54,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:31:55,946 INFO L354 Elim1Store]: treesize reduction 672, result has 10.3 percent of original size [2021-11-04 05:31:55,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 162 treesize of output 182 [2021-11-04 05:31:56,001 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:31:56,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 148 [2021-11-04 05:31:56,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:31:56,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:31:57,113 INFO L354 Elim1Store]: treesize reduction 496, result has 12.4 percent of original size [2021-11-04 05:31:57,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 694 treesize of output 519 [2021-11-04 05:31:57,127 INFO L354 Elim1Store]: treesize reduction 232, result has 0.4 percent of original size [2021-11-04 05:31:57,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 675 treesize of output 402 [2021-11-04 05:31:57,202 INFO L354 Elim1Store]: treesize reduction 272, result has 12.3 percent of original size [2021-11-04 05:31:57,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 387 treesize of output 275 [2021-11-04 05:31:57,214 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-11-04 05:31:57,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 205 [2021-11-04 05:31:57,225 INFO L354 Elim1Store]: treesize reduction 416, result has 0.2 percent of original size [2021-11-04 05:31:57,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 244 treesize of output 168 [2021-11-04 05:31:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:31:57,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 05:31:57,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514313744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:31:57,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 05:31:57,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [35] total 64 [2021-11-04 05:31:57,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942352551] [2021-11-04 05:31:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:31:57,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-04 05:31:57,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:31:57,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-04 05:31:57,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3854, Unknown=3, NotChecked=0, Total=4032 [2021-11-04 05:31:57,250 INFO L87 Difference]: Start difference. First operand 2713 states and 3876 transitions. Second operand has 33 states, 33 states have (on average 4.515151515151516) internal successors, (149), 33 states have internal predecessors, (149), 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) [2021-11-04 05:32:05,417 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:09,227 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:10,323 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:11,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:13,942 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:15,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:17,610 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:21,071 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:24,065 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:26,013 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:31,778 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:33,254 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:35,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:38,038 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:40,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:42,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:44,935 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:46,962 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:50,354 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:52,684 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:54,879 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:32:59,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:03,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:05,565 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:06,959 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:25,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:27,469 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:28,954 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:36,078 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:38,108 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:41,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:33:43,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:06,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:08,906 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:11,213 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:15,655 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:17,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:22,177 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:27,967 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:51,053 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:53,604 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:34:54,841 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:01,238 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:11,019 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:12,560 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:14,002 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:29,005 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:30,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:33,845 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:36,649 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:42,096 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:44,196 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:45,595 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:47,229 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:35:49,432 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:10,115 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:11,802 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:15,457 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:18,509 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:20,536 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:23,484 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:33,332 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:35,731 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:36:40,311 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:12,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:16,887 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:29,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:31,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:38,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:40,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:37:45,156 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 05:38:04,333 INFO L93 Difference]: Finished difference Result 26039 states and 37208 transitions. [2021-11-04 05:38:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2021-11-04 05:38:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.515151515151516) internal successors, (149), 33 states have internal predecessors, (149), 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 178 [2021-11-04 05:38:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 05:38:04,368 INFO L225 Difference]: With dead ends: 26039 [2021-11-04 05:38:04,368 INFO L226 Difference]: Without dead ends: 26037 [2021-11-04 05:38:04,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7973 ImplicationChecksByTransitivity, 36359.58ms TimeCoverageRelationStatistics Valid=2585, Invalid=27143, Unknown=28, NotChecked=0, Total=29756 [2021-11-04 05:38:04,379 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 22664 mSDsluCounter, 235366 mSDsCounter, 0 mSdLazyCounter, 221071 mSolverCounterSat, 249 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 310166.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22664 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 573.62ms SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 221071 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 62661 IncrementalHoareTripleChecker+Unchecked, 332183.68ms IncrementalHoareTripleChecker+Time [2021-11-04 05:38:04,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22664 Valid, 0 Invalid, 284008 Unknown, 0 Unchecked, 573.62ms Time], IncrementalHoareTripleChecker [249 Valid, 221071 Invalid, 27 Unknown, 62661 Unchecked, 332183.68ms Time] [2021-11-04 05:38:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26037 states. [2021-11-04 05:38:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26037 to 2773. [2021-11-04 05:38:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2772 states have (on average 1.428932178932179) internal successors, (3961), 2772 states have internal predecessors, (3961), 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) [2021-11-04 05:38:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 3961 transitions. [2021-11-04 05:38:04,885 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 3961 transitions. Word has length 178 [2021-11-04 05:38:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 05:38:04,885 INFO L470 AbstractCegarLoop]: Abstraction has 2773 states and 3961 transitions. [2021-11-04 05:38:04,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.515151515151516) internal successors, (149), 33 states have internal predecessors, (149), 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) [2021-11-04 05:38:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 3961 transitions. [2021-11-04 05:38:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-04 05:38:04,889 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 05:38:04,890 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 05:38:04,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-04 05:38:05,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:38:05,103 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-04 05:38:05,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 05:38:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1549375156, now seen corresponding path program 1 times [2021-11-04 05:38:05,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 05:38:05,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286521987] [2021-11-04 05:38:05,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:38:05,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 05:38:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:38:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:38:07,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 05:38:07,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286521987] [2021-11-04 05:38:07,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286521987] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 05:38:07,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316354284] [2021-11-04 05:38:07,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 05:38:07,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 05:38:07,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 05:38:07,006 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) [2021-11-04 05:38:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-04 05:38:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 05:38:11,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 125 conjunts are in the unsatisfiable core [2021-11-04 05:38:11,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 05:38:11,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-04 05:38:11,795 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-04 05:38:11,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-11-04 05:38:11,980 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-04 05:38:11,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-11-04 05:38:12,710 INFO L354 Elim1Store]: treesize reduction 144, result has 16.8 percent of original size [2021-11-04 05:38:12,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 64 [2021-11-04 05:38:13,485 INFO L354 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2021-11-04 05:38:13,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 71 treesize of output 71 [2021-11-04 05:38:13,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-04 05:38:13,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-04 05:38:13,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-04 05:38:13,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-11-04 05:38:13,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-04 05:38:13,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,913 INFO L388 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 29 treesize of output 13 [2021-11-04 05:38:13,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:13,919 INFO L388 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 29 treesize of output 13 [2021-11-04 05:38:14,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,006 INFO L388 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 42 treesize of output 26 [2021-11-04 05:38:14,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-04 05:38:14,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2021-11-04 05:38:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:14,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2021-11-04 05:38:14,616 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-04 05:38:14,617 INFO L388 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 3 case distinctions, treesize of input 574 treesize of output 459 [2021-11-04 05:38:15,599 INFO L354 Elim1Store]: treesize reduction 328, result has 14.4 percent of original size [2021-11-04 05:38:15,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 555 treesize of output 459 [2021-11-04 05:38:16,001 INFO L354 Elim1Store]: treesize reduction 646, result has 10.2 percent of original size [2021-11-04 05:38:16,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 416 treesize of output 414 [2021-11-04 05:38:16,128 INFO L354 Elim1Store]: treesize reduction 408, result has 11.3 percent of original size [2021-11-04 05:38:16,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 417 treesize of output 342 [2021-11-04 05:38:16,256 INFO L354 Elim1Store]: treesize reduction 530, result has 15.7 percent of original size [2021-11-04 05:38:16,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 402 treesize of output 392 [2021-11-04 05:38:16,319 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-04 05:38:16,498 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-04 05:38:16,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 37 [2021-11-04 05:38:16,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 55 [2021-11-04 05:38:16,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:16,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 59 [2021-11-04 05:38:17,123 INFO L354 Elim1Store]: treesize reduction 210, result has 17.6 percent of original size [2021-11-04 05:38:17,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 238 treesize of output 233 [2021-11-04 05:38:17,202 INFO L354 Elim1Store]: treesize reduction 308, result has 14.0 percent of original size [2021-11-04 05:38:17,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 233 treesize of output 229 [2021-11-04 05:38:17,210 INFO L354 Elim1Store]: treesize reduction 136, result has 0.7 percent of original size [2021-11-04 05:38:17,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 214 treesize of output 210 [2021-11-04 05:38:17,273 INFO L354 Elim1Store]: treesize reduction 220, result has 13.7 percent of original size [2021-11-04 05:38:17,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 195 treesize of output 192 [2021-11-04 05:38:17,596 INFO L354 Elim1Store]: treesize reduction 278, result has 15.2 percent of original size [2021-11-04 05:38:17,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 133 treesize of output 144 [2021-11-04 05:38:17,641 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:38:17,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 110 [2021-11-04 05:38:17,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:17,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:38:18,021 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:38:18,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:38:18,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,089 INFO L354 Elim1Store]: treesize reduction 232, result has 9.7 percent of original size [2021-11-04 05:38:18,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 139 treesize of output 153 [2021-11-04 05:38:18,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:18,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 125 [2021-11-04 05:38:20,394 INFO L354 Elim1Store]: treesize reduction 658, result has 11.7 percent of original size [2021-11-04 05:38:20,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 160 treesize of output 190 [2021-11-04 05:38:20,444 INFO L354 Elim1Store]: treesize reduction 200, result has 15.6 percent of original size [2021-11-04 05:38:20,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 145 treesize of output 135 [2021-11-04 05:38:20,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-04 05:38:20,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-04 05:38:20,669 INFO L354 Elim1Store]: treesize reduction 496, result has 12.4 percent of original size [2021-11-04 05:38:20,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 607 treesize of output 456 [2021-11-04 05:38:20,685 INFO L354 Elim1Store]: treesize reduction 232, result has 0.4 percent of original size [2021-11-04 05:38:20,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 588 treesize of output 339 [2021-11-04 05:38:20,768 INFO L354 Elim1Store]: treesize reduction 272, result has 12.3 percent of original size [2021-11-04 05:38:20,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 324 treesize of output 236 [2021-11-04 05:38:20,780 INFO L354 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2021-11-04 05:38:20,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 243 treesize of output 166 [2021-11-04 05:38:20,787 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-11-04 05:38:20,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 205 treesize of output 153 [2021-11-04 05:38:20,862 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2021-11-04 05:38:20,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 05:38:20,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316354284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 05:38:20,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 05:38:20,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [31] total 59 [2021-11-04 05:38:20,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354848199] [2021-11-04 05:38:20,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 05:38:20,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-04 05:38:20,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 05:38:20,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-04 05:38:20,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3253, Unknown=1, NotChecked=0, Total=3422 [2021-11-04 05:38:20,864 INFO L87 Difference]: Start difference. First operand 2773 states and 3961 transitions. Second operand has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 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) [2021-11-04 05:38:27,484 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:29,326 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:33,199 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:35,219 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:44,293 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:47,024 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:48,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:51,706 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:38:58,555 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 05:39:01,569 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15