./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.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 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 11:32:58,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 11:32:58,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 11:32:58,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 11:32:58,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 11:32:58,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 11:32:58,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 11:32:58,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 11:32:58,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 11:32:58,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 11:32:58,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 11:32:58,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 11:32:58,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 11:32:58,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 11:32:58,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 11:32:58,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 11:32:58,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 11:32:58,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 11:32:58,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 11:32:58,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 11:32:58,712 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 11:32:58,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 11:32:58,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 11:32:58,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 11:32:58,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 11:32:58,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 11:32:58,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 11:32:58,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 11:32:58,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 11:32:58,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 11:32:58,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 11:32:58,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 11:32:58,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 11:32:58,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 11:32:58,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 11:32:58,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 11:32:58,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 11:32:58,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 11:32:58,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 11:32:58,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 11:32:58,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 11:32:58,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 11:32:58,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 11:32:58,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 11:32:58,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 11:32:58,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 11:32:58,775 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 11:32:58,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 11:32:58,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 11:32:58,776 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 11:32:58,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 11:32:58,777 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 11:32:58,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 11:32:58,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 11:32:58,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 11:32:58,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 11:32:58,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 11:32:58,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 11:32:58,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 11:32:58,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 11:32:58,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 11:32:58,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 11:32:58,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 11:32:58,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 11:32:58,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:32:58,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 11:32:58,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 11:32:58,781 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 11:32:58,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 11:32:58,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 11:32:58,781 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 11:32:58,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 11:32:58,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 11:32:58,782 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 -> 6063bfeeaa4a025ac67d1a7a9b5cc20b489e34fc9db0d4dd9fcdda86c75b9c5e [2022-07-21 11:32:59,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 11:32:59,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 11:32:59,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 11:32:59,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 11:32:59,127 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 11:32:59,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-21 11:32:59,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d3bd4e97/099becd679b948db85c0b87498ef2126/FLAG7ddd65a6b [2022-07-21 11:32:59,818 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 11:32:59,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-21 11:32:59,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d3bd4e97/099becd679b948db85c0b87498ef2126/FLAG7ddd65a6b [2022-07-21 11:32:59,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d3bd4e97/099becd679b948db85c0b87498ef2126 [2022-07-21 11:32:59,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 11:32:59,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 11:32:59,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 11:32:59,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 11:33:00,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 11:33:00,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:32:59" (1/1) ... [2022-07-21 11:33:00,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b13991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:00, skipping insertion in model container [2022-07-21 11:33:00,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:32:59" (1/1) ... [2022-07-21 11:33:00,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 11:33:00,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 11:33:00,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-21 11:33:01,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:33:01,206 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 11:33:01,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i[139152,139165] [2022-07-21 11:33:01,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 11:33:01,533 INFO L208 MainTranslator]: Completed translation [2022-07-21 11:33:01,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01 WrapperNode [2022-07-21 11:33:01,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 11:33:01,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 11:33:01,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 11:33:01,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 11:33:01,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,776 INFO L137 Inliner]: procedures = 184, calls = 828, calls flagged for inlining = 92, calls inlined = 90, statements flattened = 3190 [2022-07-21 11:33:01,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 11:33:01,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 11:33:01,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 11:33:01,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 11:33:01,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 11:33:01,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 11:33:01,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 11:33:01,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 11:33:01,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (1/1) ... [2022-07-21 11:33:01,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 11:33:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:33:02,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 11:33:02,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 11:33:02,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-21 11:33:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-21 11:33:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-21 11:33:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-21 11:33:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 11:33:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-21 11:33:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-21 11:33:02,040 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-21 11:33:02,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 11:33:02,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 11:33:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 11:33:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 11:33:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 11:33:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-21 11:33:02,044 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-21 11:33:02,044 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-21 11:33:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-21 11:33:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-21 11:33:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-21 11:33:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 11:33:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 11:33:02,045 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 11:33:02,045 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 11:33:02,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 11:33:02,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 11:33:02,046 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-21 11:33:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-21 11:33:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-21 11:33:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-21 11:33:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 11:33:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 11:33:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-21 11:33:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-21 11:33:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 11:33:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 11:33:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 11:33:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 11:33:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 11:33:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-21 11:33:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-21 11:33:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 11:33:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 11:33:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-21 11:33:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-21 11:33:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-21 11:33:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-21 11:33:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 11:33:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-21 11:33:02,050 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-21 11:33:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-21 11:33:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-21 11:33:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-21 11:33:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-21 11:33:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 11:33:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-21 11:33:02,052 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-21 11:33:02,052 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-21 11:33:02,053 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-21 11:33:02,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 11:33:02,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 11:33:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 11:33:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-21 11:33:02,055 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-21 11:33:02,055 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-21 11:33:02,056 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-21 11:33:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-21 11:33:02,056 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-21 11:33:02,056 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-21 11:33:02,056 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-21 11:33:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 11:33:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-21 11:33:02,057 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-21 11:33:02,057 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 11:33:02,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 11:33:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-21 11:33:02,058 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-21 11:33:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-21 11:33:02,058 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-21 11:33:02,058 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-21 11:33:02,058 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-21 11:33:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 11:33:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-21 11:33:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-21 11:33:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 11:33:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-21 11:33:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-21 11:33:02,059 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 11:33:02,059 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 11:33:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-21 11:33:02,060 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-21 11:33:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 11:33:02,061 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 11:33:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-21 11:33:02,061 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-21 11:33:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-21 11:33:02,061 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-21 11:33:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-21 11:33:02,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-21 11:33:02,062 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-21 11:33:02,062 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-21 11:33:02,062 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-21 11:33:02,062 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-21 11:33:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-21 11:33:02,063 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-21 11:33:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-21 11:33:02,063 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-21 11:33:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 11:33:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-21 11:33:02,063 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-21 11:33:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-21 11:33:02,063 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-21 11:33:02,063 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-21 11:33:02,064 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-21 11:33:02,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 11:33:02,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 11:33:02,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 11:33:02,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 11:33:02,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 11:33:02,084 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-21 11:33:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-21 11:33:02,086 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-21 11:33:02,086 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-21 11:33:02,572 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 11:33:02,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 11:33:02,771 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 11:33:04,724 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 11:33:04,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 11:33:04,744 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 11:33:04,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:33:04 BoogieIcfgContainer [2022-07-21 11:33:04,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 11:33:04,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 11:33:04,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 11:33:04,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 11:33:04,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:32:59" (1/3) ... [2022-07-21 11:33:04,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0ebfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:33:04, skipping insertion in model container [2022-07-21 11:33:04,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:33:01" (2/3) ... [2022-07-21 11:33:04,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0ebfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:33:04, skipping insertion in model container [2022-07-21 11:33:04,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:33:04" (3/3) ... [2022-07-21 11:33:04,756 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point.cil.out.i [2022-07-21 11:33:04,768 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 11:33:04,768 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 11:33:04,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 11:33:04,860 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16adc60d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31b83fde [2022-07-21 11:33:04,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 11:33:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-07-21 11:33:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 11:33:04,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:04,882 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:33:04,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 385485251, now seen corresponding path program 1 times [2022-07-21 11:33:04,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:04,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637261214] [2022-07-21 11:33:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 11:33:05,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:05,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637261214] [2022-07-21 11:33:05,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637261214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:05,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:05,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 11:33:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227186694] [2022-07-21 11:33:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:33:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:05,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:33:05,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 11:33:05,386 INFO L87 Difference]: Start difference. First operand has 1090 states, 808 states have (on average 1.431930693069307) internal successors, (1157), 841 states have internal predecessors, (1157), 229 states have call successors, (229), 52 states have call predecessors, (229), 51 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 11:33:07,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:09,902 INFO L93 Difference]: Finished difference Result 2928 states and 4383 transitions. [2022-07-21 11:33:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:33:09,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-07-21 11:33:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:09,930 INFO L225 Difference]: With dead ends: 2928 [2022-07-21 11:33:09,931 INFO L226 Difference]: Without dead ends: 1758 [2022-07-21 11:33:09,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:33:09,941 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 1444 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 500 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 1837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:09,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 3246 Invalid, 1837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1336 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 11:33:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-07-21 11:33:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1599. [2022-07-21 11:33:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.403225806451613) internal successors, (1653), 1211 states have internal predecessors, (1653), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-21 11:33:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2318 transitions. [2022-07-21 11:33:10,126 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2318 transitions. Word has length 63 [2022-07-21 11:33:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:10,128 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2318 transitions. [2022-07-21 11:33:10,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 11:33:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2318 transitions. [2022-07-21 11:33:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 11:33:10,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:10,142 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-21 11:33:10,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 11:33:10,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:10,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1548414277, now seen corresponding path program 1 times [2022-07-21 11:33:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:10,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783047012] [2022-07-21 11:33:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:33:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 11:33:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-21 11:33:10,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:10,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783047012] [2022-07-21 11:33:10,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783047012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:10,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:10,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:33:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746692156] [2022-07-21 11:33:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:10,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:33:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:10,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:33:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:33:10,352 INFO L87 Difference]: Start difference. First operand 1599 states and 2318 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 11:33:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:12,486 INFO L93 Difference]: Finished difference Result 3364 states and 4935 transitions. [2022-07-21 11:33:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:33:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-21 11:33:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:12,497 INFO L225 Difference]: With dead ends: 3364 [2022-07-21 11:33:12,498 INFO L226 Difference]: Without dead ends: 1789 [2022-07-21 11:33:12,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:33:12,504 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 1824 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:12,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 2558 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 11:33:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-21 11:33:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-21 11:33:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.401528013582343) internal successors, (1651), 1211 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-21 11:33:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2316 transitions. [2022-07-21 11:33:12,628 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2316 transitions. Word has length 104 [2022-07-21 11:33:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:12,628 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2316 transitions. [2022-07-21 11:33:12,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 11:33:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2316 transitions. [2022-07-21 11:33:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 11:33:12,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:12,633 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-21 11:33:12,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 11:33:12,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash -480171833, now seen corresponding path program 1 times [2022-07-21 11:33:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:12,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540028833] [2022-07-21 11:33:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 11:33:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 11:33:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-21 11:33:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540028833] [2022-07-21 11:33:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540028833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:12,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:12,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:33:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638218034] [2022-07-21 11:33:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:12,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:33:12,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:12,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:33:12,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:33:12,788 INFO L87 Difference]: Start difference. First operand 1599 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 11:33:14,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:17,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:21,225 INFO L93 Difference]: Finished difference Result 3368 states and 4935 transitions. [2022-07-21 11:33:21,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:33:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2022-07-21 11:33:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:21,236 INFO L225 Difference]: With dead ends: 3368 [2022-07-21 11:33:21,236 INFO L226 Difference]: Without dead ends: 1789 [2022-07-21 11:33:21,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:33:21,246 INFO L413 NwaCegarLoop]: 1482 mSDtfsCounter, 558 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 257 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 4359 SdHoareTripleChecker+Invalid, 2479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:21,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 4359 Invalid, 2479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 2220 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-07-21 11:33:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2022-07-21 11:33:21,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1599. [2022-07-21 11:33:21,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1178 states have (on average 1.399830220713073) internal successors, (1649), 1211 states have internal predecessors, (1649), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-21 11:33:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2314 transitions. [2022-07-21 11:33:21,315 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2314 transitions. Word has length 104 [2022-07-21 11:33:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:21,316 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2314 transitions. [2022-07-21 11:33:21,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 11:33:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2314 transitions. [2022-07-21 11:33:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 11:33:21,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:21,324 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-21 11:33:21,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 11:33:21,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -899814917, now seen corresponding path program 1 times [2022-07-21 11:33:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:21,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451867245] [2022-07-21 11:33:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 11:33:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:21,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451867245] [2022-07-21 11:33:21,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451867245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:21,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:21,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:33:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967031290] [2022-07-21 11:33:21,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:21,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:33:21,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:33:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:33:21,573 INFO L87 Difference]: Start difference. First operand 1599 states and 2314 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 11:33:23,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:26,605 INFO L93 Difference]: Finished difference Result 2380 states and 3634 transitions. [2022-07-21 11:33:26,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:33:26,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2022-07-21 11:33:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:26,619 INFO L225 Difference]: With dead ends: 2380 [2022-07-21 11:33:26,619 INFO L226 Difference]: Without dead ends: 2377 [2022-07-21 11:33:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:33:26,621 INFO L413 NwaCegarLoop]: 2081 mSDtfsCounter, 1808 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 5200 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:26,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 5200 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-21 11:33:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-21 11:33:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1601. [2022-07-21 11:33:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.3991525423728814) internal successors, (1651), 1213 states have internal predecessors, (1651), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-21 11:33:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2316 transitions. [2022-07-21 11:33:26,708 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2316 transitions. Word has length 107 [2022-07-21 11:33:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:26,708 INFO L495 AbstractCegarLoop]: Abstraction has 1601 states and 2316 transitions. [2022-07-21 11:33:26,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-21 11:33:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2316 transitions. [2022-07-21 11:33:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 11:33:26,714 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:26,715 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-21 11:33:26,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 11:33:26,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:26,716 INFO L85 PathProgramCache]: Analyzing trace with hash 578773151, now seen corresponding path program 1 times [2022-07-21 11:33:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:26,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134144086] [2022-07-21 11:33:26,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 11:33:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 11:33:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:26,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134144086] [2022-07-21 11:33:26,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134144086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:26,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:26,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:33:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960314605] [2022-07-21 11:33:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:26,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:33:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:33:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:33:26,971 INFO L87 Difference]: Start difference. First operand 1601 states and 2316 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:33:29,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:32,486 INFO L93 Difference]: Finished difference Result 3957 states and 5919 transitions. [2022-07-21 11:33:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:33:32,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2022-07-21 11:33:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:32,499 INFO L225 Difference]: With dead ends: 3957 [2022-07-21 11:33:32,499 INFO L226 Difference]: Without dead ends: 2380 [2022-07-21 11:33:32,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:33:32,505 INFO L413 NwaCegarLoop]: 1835 mSDtfsCounter, 2449 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 731 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 4169 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:32,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 4169 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 2140 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 11:33:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-07-21 11:33:32,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1602. [2022-07-21 11:33:32,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1181 states have (on average 1.3988145639288738) internal successors, (1652), 1214 states have internal predecessors, (1652), 333 states have call successors, (333), 89 states have call predecessors, (333), 87 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2022-07-21 11:33:32,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2317 transitions. [2022-07-21 11:33:32,620 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2317 transitions. Word has length 117 [2022-07-21 11:33:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:32,621 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2317 transitions. [2022-07-21 11:33:32,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 11:33:32,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2317 transitions. [2022-07-21 11:33:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-21 11:33:32,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:32,627 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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] [2022-07-21 11:33:32,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 11:33:32,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1349496606, now seen corresponding path program 1 times [2022-07-21 11:33:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:32,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870276334] [2022-07-21 11:33:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:33:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 11:33:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:32,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870276334] [2022-07-21 11:33:32,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870276334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:32,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:32,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 11:33:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132963266] [2022-07-21 11:33:32,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:32,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 11:33:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:32,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 11:33:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:33:32,810 INFO L87 Difference]: Start difference. First operand 1602 states and 2317 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:33:35,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:39,215 INFO L93 Difference]: Finished difference Result 3312 states and 5203 transitions. [2022-07-21 11:33:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 11:33:39,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-07-21 11:33:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:39,231 INFO L225 Difference]: With dead ends: 3312 [2022-07-21 11:33:39,232 INFO L226 Difference]: Without dead ends: 3309 [2022-07-21 11:33:39,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-21 11:33:39,233 INFO L413 NwaCegarLoop]: 2515 mSDtfsCounter, 2306 mSDsluCounter, 6391 mSDsCounter, 0 mSdLazyCounter, 3808 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2523 SdHoareTripleChecker+Valid, 8906 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 3808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:39,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2523 Valid, 8906 Invalid, 4624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 3808 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 11:33:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2022-07-21 11:33:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 1604. [2022-07-21 11:33:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1182 states have (on average 1.398477157360406) internal successors, (1653), 1214 states have internal predecessors, (1653), 334 states have call successors, (334), 89 states have call predecessors, (334), 87 states have return successors, (333), 329 states have call predecessors, (333), 333 states have call successors, (333) [2022-07-21 11:33:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2320 transitions. [2022-07-21 11:33:39,329 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2320 transitions. Word has length 119 [2022-07-21 11:33:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:39,329 INFO L495 AbstractCegarLoop]: Abstraction has 1604 states and 2320 transitions. [2022-07-21 11:33:39,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 11:33:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2320 transitions. [2022-07-21 11:33:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-21 11:33:39,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:39,336 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:33:39,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 11:33:39,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:39,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:39,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1867335849, now seen corresponding path program 1 times [2022-07-21 11:33:39,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:39,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402648834] [2022-07-21 11:33:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:33:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 11:33:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:33:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 11:33:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 11:33:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-21 11:33:39,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:39,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402648834] [2022-07-21 11:33:39,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402648834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:39,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:39,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:33:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056372906] [2022-07-21 11:33:39,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:39,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:33:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:33:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:33:39,575 INFO L87 Difference]: Start difference. First operand 1604 states and 2320 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 11:33:41,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:44,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:47,094 INFO L93 Difference]: Finished difference Result 3997 states and 5840 transitions. [2022-07-21 11:33:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 11:33:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2022-07-21 11:33:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:47,104 INFO L225 Difference]: With dead ends: 3997 [2022-07-21 11:33:47,105 INFO L226 Difference]: Without dead ends: 2417 [2022-07-21 11:33:47,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 11:33:47,109 INFO L413 NwaCegarLoop]: 2205 mSDtfsCounter, 2304 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 886 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2491 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:47,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2491 Valid, 3565 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 1145 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-21 11:33:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-07-21 11:33:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2144. [2022-07-21 11:33:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 1571 states have (on average 1.3908338637810311) internal successors, (2185), 1612 states have internal predecessors, (2185), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-21 11:33:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 3080 transitions. [2022-07-21 11:33:47,235 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 3080 transitions. Word has length 149 [2022-07-21 11:33:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:47,236 INFO L495 AbstractCegarLoop]: Abstraction has 2144 states and 3080 transitions. [2022-07-21 11:33:47,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 11:33:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 3080 transitions. [2022-07-21 11:33:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 11:33:47,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:47,247 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:33:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 11:33:47,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash 178046639, now seen corresponding path program 1 times [2022-07-21 11:33:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:47,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966364091] [2022-07-21 11:33:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:33:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 11:33:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 11:33:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 11:33:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 11:33:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-21 11:33:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:47,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966364091] [2022-07-21 11:33:47,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966364091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:47,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:47,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:33:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889905802] [2022-07-21 11:33:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:47,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:33:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:33:47,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:33:47,458 INFO L87 Difference]: Start difference. First operand 2144 states and 3080 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 11:33:49,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:52,036 INFO L93 Difference]: Finished difference Result 4586 states and 6826 transitions. [2022-07-21 11:33:52,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 11:33:52,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2022-07-21 11:33:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:52,049 INFO L225 Difference]: With dead ends: 4586 [2022-07-21 11:33:52,050 INFO L226 Difference]: Without dead ends: 3006 [2022-07-21 11:33:52,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:33:52,055 INFO L413 NwaCegarLoop]: 2005 mSDtfsCounter, 2750 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 941 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3006 SdHoareTripleChecker+Valid, 3728 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 941 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:52,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3006 Valid, 3728 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [941 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 11:33:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-21 11:33:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2148. [2022-07-21 11:33:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3904761904761904) internal successors, (2190), 1616 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-21 11:33:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3085 transitions. [2022-07-21 11:33:52,198 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3085 transitions. Word has length 151 [2022-07-21 11:33:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:52,198 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3085 transitions. [2022-07-21 11:33:52,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-21 11:33:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3085 transitions. [2022-07-21 11:33:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-21 11:33:52,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:52,208 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:33:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 11:33:52,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1182989250, now seen corresponding path program 1 times [2022-07-21 11:33:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:52,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644438467] [2022-07-21 11:33:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:33:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:33:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 11:33:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 11:33:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 11:33:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-21 11:33:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:52,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644438467] [2022-07-21 11:33:52,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644438467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:33:52,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:33:52,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 11:33:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928611058] [2022-07-21 11:33:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:33:52,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 11:33:52,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 11:33:52,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 11:33:52,404 INFO L87 Difference]: Start difference. First operand 2148 states and 3085 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 11:33:54,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:33:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:33:56,939 INFO L93 Difference]: Finished difference Result 4546 states and 6642 transitions. [2022-07-21 11:33:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 11:33:56,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 154 [2022-07-21 11:33:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:33:56,950 INFO L225 Difference]: With dead ends: 4546 [2022-07-21 11:33:56,950 INFO L226 Difference]: Without dead ends: 2422 [2022-07-21 11:33:56,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:33:56,957 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 551 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 265 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 3477 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 11:33:56,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 3477 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1469 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 11:33:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-07-21 11:33:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2148. [2022-07-21 11:33:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1575 states have (on average 1.3847619047619049) internal successors, (2181), 1616 states have internal predecessors, (2181), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-21 11:33:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 3076 transitions. [2022-07-21 11:33:57,091 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 3076 transitions. Word has length 154 [2022-07-21 11:33:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:33:57,091 INFO L495 AbstractCegarLoop]: Abstraction has 2148 states and 3076 transitions. [2022-07-21 11:33:57,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 4 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 11:33:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 3076 transitions. [2022-07-21 11:33:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 11:33:57,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:33:57,101 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:33:57,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 11:33:57,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:33:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:33:57,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1835092685, now seen corresponding path program 1 times [2022-07-21 11:33:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:33:57,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122321435] [2022-07-21 11:33:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:33:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:33:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:33:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:33:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:33:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:33:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:33:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:33:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:33:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:33:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:33:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:33:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:33:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 11:33:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 11:33:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 11:33:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 11:33:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-21 11:33:57,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:33:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122321435] [2022-07-21 11:33:57,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122321435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:33:57,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214398035] [2022-07-21 11:33:57,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:33:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:33:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:33:57,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:33:57,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 11:33:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:33:57,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 11:33:57,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:33:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 11:33:58,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:33:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-21 11:33:58,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214398035] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 11:33:58,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 11:33:58,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-21 11:33:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600922358] [2022-07-21 11:33:58,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 11:33:58,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 11:33:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:33:58,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 11:33:58,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-21 11:33:58,190 INFO L87 Difference]: Start difference. First operand 2148 states and 3076 transitions. Second operand has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-21 11:34:01,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:34:04,720 INFO L93 Difference]: Finished difference Result 6340 states and 9749 transitions. [2022-07-21 11:34:04,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 11:34:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 157 [2022-07-21 11:34:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:34:04,743 INFO L225 Difference]: With dead ends: 6340 [2022-07-21 11:34:04,743 INFO L226 Difference]: Without dead ends: 4756 [2022-07-21 11:34:04,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-21 11:34:04,749 INFO L413 NwaCegarLoop]: 2675 mSDtfsCounter, 5998 mSDsluCounter, 4316 mSDsCounter, 0 mSdLazyCounter, 4011 mSolverCounterSat, 2167 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6372 SdHoareTripleChecker+Valid, 6991 SdHoareTripleChecker+Invalid, 6179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2167 IncrementalHoareTripleChecker+Valid, 4011 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:34:04,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6372 Valid, 6991 Invalid, 6179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2167 Valid, 4011 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-07-21 11:34:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2022-07-21 11:34:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2155. [2022-07-21 11:34:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1582 states have (on average 1.384323640960809) internal successors, (2190), 1623 states have internal predecessors, (2190), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-21 11:34:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 3085 transitions. [2022-07-21 11:34:04,922 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 3085 transitions. Word has length 157 [2022-07-21 11:34:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:34:04,923 INFO L495 AbstractCegarLoop]: Abstraction has 2155 states and 3085 transitions. [2022-07-21 11:34:04,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.416666666666666) internal successors, (185), 10 states have internal predecessors, (185), 4 states have call successors, (45), 5 states have call predecessors, (45), 3 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2022-07-21 11:34:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 3085 transitions. [2022-07-21 11:34:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-21 11:34:04,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:34:04,932 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:34:04,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 11:34:05,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 11:34:05,160 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:34:05,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:34:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1991118289, now seen corresponding path program 1 times [2022-07-21 11:34:05,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:34:05,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883280750] [2022-07-21 11:34:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:34:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:34:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:34:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:34:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:34:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:34:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:34:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:34:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:34:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:34:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:34:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:34:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:34:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 11:34:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:34:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 11:34:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 11:34:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-21 11:34:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:34:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883280750] [2022-07-21 11:34:05,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883280750] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:34:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468807275] [2022-07-21 11:34:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:34:05,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:34:05,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:34:05,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 11:34:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:05,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 11:34:05,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:34:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-21 11:34:06,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:34:06,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468807275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:34:06,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:34:06,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-07-21 11:34:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355022301] [2022-07-21 11:34:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:34:06,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 11:34:06,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:34:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 11:34:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 11:34:06,006 INFO L87 Difference]: Start difference. First operand 2155 states and 3085 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 11:34:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:34:06,470 INFO L93 Difference]: Finished difference Result 4676 states and 6864 transitions. [2022-07-21 11:34:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 11:34:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2022-07-21 11:34:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:34:06,484 INFO L225 Difference]: With dead ends: 4676 [2022-07-21 11:34:06,484 INFO L226 Difference]: Without dead ends: 3085 [2022-07-21 11:34:06,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 11:34:06,490 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 926 mSDsluCounter, 3624 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:34:06,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 5794 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:34:06,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-07-21 11:34:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2157. [2022-07-21 11:34:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2157 states, 1584 states have (on average 1.3838383838383839) internal successors, (2192), 1625 states have internal predecessors, (2192), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-21 11:34:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 3087 transitions. [2022-07-21 11:34:06,659 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 3087 transitions. Word has length 166 [2022-07-21 11:34:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:34:06,659 INFO L495 AbstractCegarLoop]: Abstraction has 2157 states and 3087 transitions. [2022-07-21 11:34:06,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 11:34:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 3087 transitions. [2022-07-21 11:34:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-21 11:34:06,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:34:06,669 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:34:06,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 11:34:06,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 11:34:06,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:34:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:34:06,883 INFO L85 PathProgramCache]: Analyzing trace with hash -530211425, now seen corresponding path program 1 times [2022-07-21 11:34:06,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:34:06,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690341945] [2022-07-21 11:34:06,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:06,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:34:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:34:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:34:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:34:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:34:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:34:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:34:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:34:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:34:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:34:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:34:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:34:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:34:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-21 11:34:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 11:34:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 11:34:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 11:34:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 11:34:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:34:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-07-21 11:34:07,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:34:07,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690341945] [2022-07-21 11:34:07,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690341945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:34:07,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 11:34:07,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 11:34:07,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471542198] [2022-07-21 11:34:07,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:34:07,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:34:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:34:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:34:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 11:34:07,067 INFO L87 Difference]: Start difference. First operand 2157 states and 3087 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 11:34:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:34:11,153 INFO L93 Difference]: Finished difference Result 4652 states and 6903 transitions. [2022-07-21 11:34:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:34:11,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 175 [2022-07-21 11:34:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:34:11,168 INFO L225 Difference]: With dead ends: 4652 [2022-07-21 11:34:11,168 INFO L226 Difference]: Without dead ends: 3059 [2022-07-21 11:34:11,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-21 11:34:11,173 INFO L413 NwaCegarLoop]: 1983 mSDtfsCounter, 1543 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 714 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 5111 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 714 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-21 11:34:11,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 5111 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [714 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-21 11:34:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2022-07-21 11:34:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2159. [2022-07-21 11:34:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1586 states have (on average 1.3833543505674653) internal successors, (2194), 1627 states have internal predecessors, (2194), 448 states have call successors, (448), 126 states have call predecessors, (448), 124 states have return successors, (447), 441 states have call predecessors, (447), 447 states have call successors, (447) [2022-07-21 11:34:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3089 transitions. [2022-07-21 11:34:11,350 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3089 transitions. Word has length 175 [2022-07-21 11:34:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:34:11,350 INFO L495 AbstractCegarLoop]: Abstraction has 2159 states and 3089 transitions. [2022-07-21 11:34:11,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 11:34:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3089 transitions. [2022-07-21 11:34:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 11:34:11,360 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:34:11,360 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:34:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 11:34:11,360 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:34:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:34:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1482100280, now seen corresponding path program 1 times [2022-07-21 11:34:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:34:11,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471874425] [2022-07-21 11:34:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:11,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:34:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:34:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:34:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:34:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:34:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:34:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:34:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:34:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:34:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:34:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:34:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:34:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:34:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 11:34:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 11:34:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 11:34:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 11:34:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:34:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 11:34:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 11:34:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-21 11:34:11,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:34:11,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471874425] [2022-07-21 11:34:11,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471874425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:34:11,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586850186] [2022-07-21 11:34:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:11,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:34:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:34:11,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:34:11,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 11:34:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:12,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 11:34:12,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:34:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-21 11:34:12,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 11:34:12,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586850186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 11:34:12,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 11:34:12,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2022-07-21 11:34:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113689964] [2022-07-21 11:34:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 11:34:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 11:34:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:34:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 11:34:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-21 11:34:12,512 INFO L87 Difference]: Start difference. First operand 2159 states and 3089 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 11:34:13,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:34:13,063 INFO L93 Difference]: Finished difference Result 4849 states and 7125 transitions. [2022-07-21 11:34:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 11:34:13,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 183 [2022-07-21 11:34:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:34:13,075 INFO L225 Difference]: With dead ends: 4849 [2022-07-21 11:34:13,075 INFO L226 Difference]: Without dead ends: 3254 [2022-07-21 11:34:13,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-21 11:34:13,081 INFO L413 NwaCegarLoop]: 2279 mSDtfsCounter, 1174 mSDsluCounter, 8352 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 10631 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 11:34:13,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 10631 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 11:34:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2022-07-21 11:34:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 2164. [2022-07-21 11:34:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 1590 states have (on average 1.3823899371069182) internal successors, (2198), 1631 states have internal predecessors, (2198), 448 states have call successors, (448), 126 states have call predecessors, (448), 125 states have return successors, (451), 442 states have call predecessors, (451), 447 states have call successors, (451) [2022-07-21 11:34:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 3097 transitions. [2022-07-21 11:34:13,276 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 3097 transitions. Word has length 183 [2022-07-21 11:34:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:34:13,279 INFO L495 AbstractCegarLoop]: Abstraction has 2164 states and 3097 transitions. [2022-07-21 11:34:13,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 11:34:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 3097 transitions. [2022-07-21 11:34:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-21 11:34:13,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:34:13,288 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:34:13,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 11:34:13,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:34:13,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:34:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:34:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash 503652149, now seen corresponding path program 1 times [2022-07-21 11:34:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:34:13,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549261648] [2022-07-21 11:34:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:34:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:34:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:34:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:34:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:34:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:34:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:34:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:34:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:34:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 11:34:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 11:34:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 11:34:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 11:34:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 11:34:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 11:34:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 11:34:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 11:34:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 11:34:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 11:34:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-21 11:34:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-07-21 11:34:13,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:34:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549261648] [2022-07-21 11:34:13,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549261648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:34:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348837471] [2022-07-21 11:34:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:13,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:34:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:34:13,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:34:13,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 11:34:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:14,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 1528 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-21 11:34:14,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:34:14,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:34:15,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:34:15,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-21 11:34:15,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:34:15,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 11:34:15,323 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 11:34:15,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-07-21 11:34:15,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 11:34:15,526 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-21 11:34:15,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-21 11:34:15,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-21 11:34:15,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-21 11:34:15,744 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-21 11:34:15,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-07-21 11:34:15,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-21 11:34:15,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-21 11:34:15,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-21 11:34:15,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 11:34:15,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 11:34:15,893 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-21 11:34:15,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2022-07-21 11:34:15,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-21 11:34:15,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-21 11:34:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:15,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-07-21 11:34:15,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 11:34:15,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 11:34:16,134 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-21 11:34:16,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-21 11:34:16,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-21 11:34:16,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 11:34:16,417 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-21 11:34:16,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-21 11:34:16,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-21 11:34:16,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 11:34:16,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2022-07-21 11:34:16,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 29 [2022-07-21 11:34:16,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:16,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 11:34:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-21 11:34:16,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:34:16,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_832) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_830) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (<= .cse0 0)))) is different from false [2022-07-21 11:34:16,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348837471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:34:16,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:34:16,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 30] total 40 [2022-07-21 11:34:16,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326658883] [2022-07-21 11:34:16,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:34:16,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 11:34:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:34:16,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 11:34:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1441, Unknown=1, NotChecked=76, Total=1640 [2022-07-21 11:34:16,984 INFO L87 Difference]: Start difference. First operand 2164 states and 3097 transitions. Second operand has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-21 11:34:20,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 11:34:33,296 INFO L93 Difference]: Finished difference Result 5266 states and 7930 transitions. [2022-07-21 11:34:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-21 11:34:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) Word has length 189 [2022-07-21 11:34:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 11:34:33,307 INFO L225 Difference]: With dead ends: 5266 [2022-07-21 11:34:33,308 INFO L226 Difference]: Without dead ends: 3645 [2022-07-21 11:34:33,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 205 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1289 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=4278, Unknown=1, NotChecked=134, Total=4830 [2022-07-21 11:34:33,312 INFO L413 NwaCegarLoop]: 2370 mSDtfsCounter, 5183 mSDsluCounter, 22024 mSDsCounter, 0 mSdLazyCounter, 24887 mSolverCounterSat, 2803 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5362 SdHoareTripleChecker+Valid, 24394 SdHoareTripleChecker+Invalid, 30182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2803 IncrementalHoareTripleChecker+Valid, 24887 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2491 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-21 11:34:33,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5362 Valid, 24394 Invalid, 30182 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2803 Valid, 24887 Invalid, 1 Unknown, 2491 Unchecked, 15.1s Time] [2022-07-21 11:34:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2022-07-21 11:34:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 2180. [2022-07-21 11:34:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1644 states have internal predecessors, (2209), 448 states have call successors, (448), 126 states have call predecessors, (448), 130 states have return successors, (465), 445 states have call predecessors, (465), 447 states have call successors, (465) [2022-07-21 11:34:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3122 transitions. [2022-07-21 11:34:33,549 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3122 transitions. Word has length 189 [2022-07-21 11:34:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 11:34:33,549 INFO L495 AbstractCegarLoop]: Abstraction has 2180 states and 3122 transitions. [2022-07-21 11:34:33,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.641025641025641) internal successors, (220), 29 states have internal predecessors, (220), 10 states have call successors, (43), 10 states have call predecessors, (43), 12 states have return successors, (35), 14 states have call predecessors, (35), 10 states have call successors, (35) [2022-07-21 11:34:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3122 transitions. [2022-07-21 11:34:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-21 11:34:33,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 11:34:33,561 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 11:34:33,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 11:34:33,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:34:33,776 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 11:34:33,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 11:34:33,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1115474398, now seen corresponding path program 1 times [2022-07-21 11:34:33,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 11:34:33,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754131912] [2022-07-21 11:34:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 11:34:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 11:34:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 11:34:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 11:34:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 11:34:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 11:34:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:34,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 11:34:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 11:34:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 11:34:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 11:34:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 11:34:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 11:34:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 11:34:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 11:34:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 11:34:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 11:34:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 11:34:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 11:34:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 11:34:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 11:34:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 11:34:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-21 11:34:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 11:34:35,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754131912] [2022-07-21 11:34:35,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754131912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:34:35,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147181712] [2022-07-21 11:34:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 11:34:35,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 11:34:35,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 11:34:35,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 11:34:35,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 11:34:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 11:34:36,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 187 conjunts are in the unsatisfiable core [2022-07-21 11:34:36,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 11:34:36,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 11:34:36,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:34:36,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:34:37,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:37,082 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-07-21 11:34:37,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 20 treesize of output 30 [2022-07-21 11:34:37,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 11:34:37,334 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 11:34:37,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-21 11:34:37,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:34:37,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 11:34:37,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:37,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:37,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:37,935 INFO L390 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 26 treesize of output 29 [2022-07-21 11:34:37,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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 [2022-07-21 11:34:38,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-21 11:34:38,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,051 INFO L390 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 29 treesize of output 28 [2022-07-21 11:34:38,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,064 INFO L390 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 23 treesize of output 22 [2022-07-21 11:34:38,372 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-21 11:34:38,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-21 11:34:38,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,389 INFO L390 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 45 treesize of output 42 [2022-07-21 11:34:38,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,400 INFO L390 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 34 treesize of output 37 [2022-07-21 11:34:38,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,705 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-07-21 11:34:38,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,715 INFO L390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-21 11:34:38,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-21 11:34:38,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 11:34:38,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-21 11:34:38,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 11:34:38,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-21 11:34:38,924 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 11:34:38,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2022-07-21 11:34:38,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-21 11:34:38,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-21 11:34:38,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:38,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 11:34:38,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 11:34:39,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-21 11:34:39,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 11:34:39,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 11:34:39,658 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 11:34:39,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-21 11:34:39,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-21 11:34:39,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:39,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2022-07-21 11:34:40,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:40,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 39 treesize of output 27 [2022-07-21 11:34:40,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:40,236 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-21 11:34:40,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 32 [2022-07-21 11:34:40,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 11:34:40,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-21 11:34:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 64 proven. 13 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-21 11:34:40,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 11:34:40,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1105) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1107) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1106) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (<= .cse0 0) (not (<= .cse0 2147483647))))) is different from false [2022-07-21 11:34:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147181712] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 11:34:40,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 11:34:40,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 68 [2022-07-21 11:34:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491041291] [2022-07-21 11:34:40,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 11:34:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-21 11:34:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 11:34:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-21 11:34:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4355, Unknown=1, NotChecked=132, Total=4692 [2022-07-21 11:34:40,289 INFO L87 Difference]: Start difference. First operand 2180 states and 3122 transitions. Second operand has 68 states, 66 states have (on average 3.515151515151515) internal successors, (232), 54 states have internal predecessors, (232), 22 states have call successors, (45), 13 states have call predecessors, (45), 17 states have return successors, (37), 25 states have call predecessors, (37), 21 states have call successors, (37) [2022-07-21 11:34:47,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:49,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:51,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:53,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:55,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:34:58,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:00,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:02,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:04,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:06,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:08,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:37,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:39,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:42,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:56,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:35:58,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:01,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:06,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:09,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:16,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:19,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:21,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:23,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 11:36:37,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []