./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 05:24:32,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 05:24:32,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 05:24:32,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 05:24:32,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 05:24:32,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 05:24:32,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 05:24:32,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 05:24:32,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 05:24:32,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 05:24:32,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 05:24:32,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 05:24:32,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 05:24:32,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 05:24:32,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 05:24:32,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 05:24:32,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 05:24:32,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 05:24:32,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 05:24:32,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 05:24:32,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 05:24:32,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 05:24:32,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 05:24:32,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 05:24:32,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 05:24:32,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 05:24:32,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 05:24:32,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 05:24:32,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 05:24:32,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 05:24:32,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 05:24:32,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 05:24:32,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 05:24:32,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 05:24:32,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 05:24:32,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 05:24:32,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 05:24:32,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 05:24:32,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 05:24:32,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 05:24:32,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 05:24:32,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 05:24:32,516 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 05:24:32,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 05:24:32,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 05:24:32,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 05:24:32,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 05:24:32,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 05:24:32,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 05:24:32,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 05:24:32,521 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 05:24:32,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 05:24:32,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 05:24:32,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 05:24:32,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 05:24:32,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 05:24:32,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 05:24:32,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 05:24:32,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 05:24:32,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 05:24:32,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 05:24:32,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 05:24:32,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 05:24:32,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 05:24:32,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 05:24:32,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 05:24:32,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 05:24:32,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 05:24:32,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 05:24:32,526 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 05:24:32,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 05:24:32,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 05:24:32,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 05:24:32,527 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2021-12-18 05:24:32,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 05:24:32,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 05:24:32,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 05:24:32,799 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 05:24:32,800 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 05:24:32,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-12-18 05:24:32,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da8b1d86/3a92354feb55435a9ca1cc0c5eefbeda/FLAG508e7d932 [2021-12-18 05:24:33,543 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 05:24:33,544 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-12-18 05:24:33,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da8b1d86/3a92354feb55435a9ca1cc0c5eefbeda/FLAG508e7d932 [2021-12-18 05:24:33,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da8b1d86/3a92354feb55435a9ca1cc0c5eefbeda [2021-12-18 05:24:33,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 05:24:33,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 05:24:33,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 05:24:33,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 05:24:33,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 05:24:33,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:24:33" (1/1) ... [2021-12-18 05:24:33,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395e31cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:33, skipping insertion in model container [2021-12-18 05:24:33,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:24:33" (1/1) ... [2021-12-18 05:24:33,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 05:24:33,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 05:24:34,941 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-12-18 05:24:34,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 05:24:35,021 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 05:24:35,273 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-12-18 05:24:35,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 05:24:35,374 INFO L208 MainTranslator]: Completed translation [2021-12-18 05:24:35,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35 WrapperNode [2021-12-18 05:24:35,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 05:24:35,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 05:24:35,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 05:24:35,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 05:24:35,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,560 INFO L137 Inliner]: procedures = 187, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3212 [2021-12-18 05:24:35,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 05:24:35,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 05:24:35,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 05:24:35,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 05:24:35,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 05:24:35,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 05:24:35,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 05:24:35,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 05:24:35,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (1/1) ... [2021-12-18 05:24:35,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 05:24:35,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:24:35,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 05:24:35,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 05:24:35,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2021-12-18 05:24:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2021-12-18 05:24:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2021-12-18 05:24:35,841 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2021-12-18 05:24:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 05:24:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-12-18 05:24:35,841 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2021-12-18 05:24:35,842 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2021-12-18 05:24:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 05:24:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 05:24:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-18 05:24:35,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-18 05:24:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 05:24:35,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-18 05:24:35,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-18 05:24:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-18 05:24:35,843 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-18 05:24:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2021-12-18 05:24:35,843 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2021-12-18 05:24:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2021-12-18 05:24:35,843 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2021-12-18 05:24:35,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 05:24:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 05:24:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2021-12-18 05:24:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2021-12-18 05:24:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 05:24:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 05:24:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-12-18 05:24:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-12-18 05:24:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2021-12-18 05:24:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2021-12-18 05:24:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 05:24:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 05:24:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2021-12-18 05:24:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2021-12-18 05:24:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 05:24:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-18 05:24:35,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-12-18 05:24:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-12-18 05:24:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 05:24:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-18 05:24:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2021-12-18 05:24:35,898 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 05:24:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2021-12-18 05:24:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2021-12-18 05:24:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-12-18 05:24:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-12-18 05:24:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2021-12-18 05:24:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2021-12-18 05:24:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2021-12-18 05:24:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2021-12-18 05:24:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 05:24:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-12-18 05:24:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-12-18 05:24:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2021-12-18 05:24:35,899 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2021-12-18 05:24:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2021-12-18 05:24:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2021-12-18 05:24:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2021-12-18 05:24:35,900 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2021-12-18 05:24:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-12-18 05:24:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2021-12-18 05:24:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-12-18 05:24:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2021-12-18 05:24:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2021-12-18 05:24:35,901 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 05:24:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2021-12-18 05:24:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2021-12-18 05:24:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 05:24:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2021-12-18 05:24:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2021-12-18 05:24:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-12-18 05:24:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-12-18 05:24:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2021-12-18 05:24:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2021-12-18 05:24:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-18 05:24:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-18 05:24:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-12-18 05:24:35,902 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-12-18 05:24:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2021-12-18 05:24:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2021-12-18 05:24:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2021-12-18 05:24:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2021-12-18 05:24:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 05:24:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 05:24:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 05:24:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 05:24:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-12-18 05:24:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-12-18 05:24:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-12-18 05:24:35,903 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-12-18 05:24:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 05:24:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-18 05:24:35,904 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-18 05:24:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2021-12-18 05:24:35,904 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2021-12-18 05:24:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2021-12-18 05:24:35,907 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2021-12-18 05:24:35,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 05:24:35,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 05:24:35,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 05:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2021-12-18 05:24:35,910 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2021-12-18 05:24:35,910 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-18 05:24:35,912 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-18 05:24:36,439 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 05:24:36,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 05:24:36,627 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-18 05:24:38,407 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 05:24:38,421 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 05:24:38,421 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 05:24:38,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:24:38 BoogieIcfgContainer [2021-12-18 05:24:38,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 05:24:38,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 05:24:38,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 05:24:38,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 05:24:38,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:24:33" (1/3) ... [2021-12-18 05:24:38,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f39ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:24:38, skipping insertion in model container [2021-12-18 05:24:38,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:24:35" (2/3) ... [2021-12-18 05:24:38,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f39ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:24:38, skipping insertion in model container [2021-12-18 05:24:38,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:24:38" (3/3) ... [2021-12-18 05:24:38,436 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-12-18 05:24:38,440 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 05:24:38,441 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 05:24:38,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 05:24:38,488 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 05:24:38,488 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 05:24:38,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 816 states have (on average 1.4227941176470589) internal successors, (1161), 848 states have internal predecessors, (1161), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2021-12-18 05:24:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-18 05:24:38,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:24:38,548 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-18 05:24:38,548 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:24:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:24:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1170411247, now seen corresponding path program 1 times [2021-12-18 05:24:38,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:24:38,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355026542] [2021-12-18 05:24:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:24:38,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:24:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:24:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:24:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:24:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:24:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:24:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:24:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:24:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:24:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:24:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:24:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:24:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:24:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:24:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:24:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-18 05:24:39,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:24:39,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355026542] [2021-12-18 05:24:39,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355026542] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:24:39,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:24:39,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 05:24:39,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56570127] [2021-12-18 05:24:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:24:39,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 05:24:39,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:24:39,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 05:24:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-18 05:24:39,419 INFO L87 Difference]: Start difference. First operand has 1106 states, 816 states have (on average 1.4227941176470589) internal successors, (1161), 848 states have internal predecessors, (1161), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-18 05:24:41,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:24:43,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:24:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:24:45,551 INFO L93 Difference]: Finished difference Result 2338 states and 3505 transitions. [2021-12-18 05:24:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 05:24:45,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2021-12-18 05:24:45,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:24:45,581 INFO L225 Difference]: With dead ends: 2338 [2021-12-18 05:24:45,581 INFO L226 Difference]: Without dead ends: 1194 [2021-12-18 05:24:45,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-18 05:24:45,599 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 1085 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2021-12-18 05:24:45,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1139 Valid, 3690 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2021-12-18 05:24:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2021-12-18 05:24:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1064. [2021-12-18 05:24:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 787 states have (on average 1.4142312579415501) internal successors, (1113), 811 states have internal predecessors, (1113), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2021-12-18 05:24:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1561 transitions. [2021-12-18 05:24:45,736 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1561 transitions. Word has length 161 [2021-12-18 05:24:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:24:45,736 INFO L470 AbstractCegarLoop]: Abstraction has 1064 states and 1561 transitions. [2021-12-18 05:24:45,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-18 05:24:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1561 transitions. [2021-12-18 05:24:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-18 05:24:45,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:24:45,748 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-18 05:24:45,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 05:24:45,748 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:24:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:24:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -448386267, now seen corresponding path program 1 times [2021-12-18 05:24:45,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:24:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885144303] [2021-12-18 05:24:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:24:45,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:24:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:24:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:24:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:24:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:24:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:24:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:24:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:24:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:24:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:24:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:24:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:24:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:24:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:24:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:24:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2021-12-18 05:24:46,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:24:46,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885144303] [2021-12-18 05:24:46,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885144303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:24:46,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:24:46,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 05:24:46,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449926274] [2021-12-18 05:24:46,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:24:46,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 05:24:46,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:24:46,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 05:24:46,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 05:24:46,126 INFO L87 Difference]: Start difference. First operand 1064 states and 1561 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-18 05:24:48,140 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 [] [2021-12-18 05:24:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:24:51,882 INFO L93 Difference]: Finished difference Result 2884 states and 4254 transitions. [2021-12-18 05:24:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 05:24:51,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 161 [2021-12-18 05:24:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:24:51,895 INFO L225 Difference]: With dead ends: 2884 [2021-12-18 05:24:51,895 INFO L226 Difference]: Without dead ends: 1856 [2021-12-18 05:24:51,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-18 05:24:51,902 INFO L933 BasicCegarLoop]: 1535 mSDtfsCounter, 2328 mSDsluCounter, 2972 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 1206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 4507 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1206 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-12-18 05:24:51,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2467 Valid, 4507 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1206 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2021-12-18 05:24:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2021-12-18 05:24:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1624. [2021-12-18 05:24:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1191 states have (on average 1.397984886649874) internal successors, (1665), 1224 states have internal predecessors, (1665), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:24:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2347 transitions. [2021-12-18 05:24:52,014 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2347 transitions. Word has length 161 [2021-12-18 05:24:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:24:52,017 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 2347 transitions. [2021-12-18 05:24:52,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-18 05:24:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2347 transitions. [2021-12-18 05:24:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-12-18 05:24:52,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:24:52,026 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:24:52,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 05:24:52,027 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:24:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:24:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1775569213, now seen corresponding path program 1 times [2021-12-18 05:24:52,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:24:52,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829004933] [2021-12-18 05:24:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:24:52,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:24:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:24:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:24:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:24:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:24:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:24:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:24:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:24:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:24:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:24:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:24:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:24:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:24:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:24:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:24:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:24:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 05:24:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-18 05:24:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:52,454 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2021-12-18 05:24:52,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:24:52,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829004933] [2021-12-18 05:24:52,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829004933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:24:52,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:24:52,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 05:24:52,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141756289] [2021-12-18 05:24:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:24:52,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 05:24:52,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:24:52,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 05:24:52,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 05:24:52,457 INFO L87 Difference]: Start difference. First operand 1624 states and 2347 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-18 05:24:54,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:24:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:24:57,077 INFO L93 Difference]: Finished difference Result 3434 states and 5029 transitions. [2021-12-18 05:24:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 05:24:57,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 222 [2021-12-18 05:24:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:24:57,089 INFO L225 Difference]: With dead ends: 3434 [2021-12-18 05:24:57,089 INFO L226 Difference]: Without dead ends: 1856 [2021-12-18 05:24:57,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-18 05:24:57,098 INFO L933 BasicCegarLoop]: 1452 mSDtfsCounter, 2780 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:24:57,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2922 Valid, 2916 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1229 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-12-18 05:24:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2021-12-18 05:24:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1624. [2021-12-18 05:24:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1191 states have (on average 1.396305625524769) internal successors, (1663), 1224 states have internal predecessors, (1663), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:24:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2345 transitions. [2021-12-18 05:24:57,173 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2345 transitions. Word has length 222 [2021-12-18 05:24:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:24:57,174 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 2345 transitions. [2021-12-18 05:24:57,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2021-12-18 05:24:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2345 transitions. [2021-12-18 05:24:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-12-18 05:24:57,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:24:57,180 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:24:57,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 05:24:57,180 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:24:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:24:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 132888577, now seen corresponding path program 1 times [2021-12-18 05:24:57,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:24:57,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476905932] [2021-12-18 05:24:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:24:57,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:24:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:24:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:24:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:24:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:24:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:24:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:24:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:24:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:24:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:24:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:24:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:24:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:24:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:24:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:24:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:24:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-18 05:24:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-18 05:24:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:24:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:24:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:24:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2021-12-18 05:24:57,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:24:57,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476905932] [2021-12-18 05:24:57,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476905932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:24:57,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:24:57,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 05:24:57,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471037881] [2021-12-18 05:24:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:24:57,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:24:57,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:24:57,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:24:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:24:57,514 INFO L87 Difference]: Start difference. First operand 1624 states and 2345 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-18 05:25:00,538 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 [] [2021-12-18 05:25:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:02,733 INFO L93 Difference]: Finished difference Result 3438 states and 5029 transitions. [2021-12-18 05:25:02,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 05:25:02,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 222 [2021-12-18 05:25:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:02,746 INFO L225 Difference]: With dead ends: 3438 [2021-12-18 05:25:02,747 INFO L226 Difference]: Without dead ends: 1856 [2021-12-18 05:25:02,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-18 05:25:02,753 INFO L933 BasicCegarLoop]: 1463 mSDtfsCounter, 1195 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 2496 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 5073 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 2496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:02,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 5073 Invalid, 3149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 2496 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-12-18 05:25:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2021-12-18 05:25:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1624. [2021-12-18 05:25:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1191 states have (on average 1.3946263643996641) internal successors, (1661), 1224 states have internal predecessors, (1661), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:25:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2343 transitions. [2021-12-18 05:25:02,822 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2343 transitions. Word has length 222 [2021-12-18 05:25:02,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:02,823 INFO L470 AbstractCegarLoop]: Abstraction has 1624 states and 2343 transitions. [2021-12-18 05:25:02,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2021-12-18 05:25:02,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2343 transitions. [2021-12-18 05:25:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-12-18 05:25:02,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:02,828 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:02,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 05:25:02,828 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1941303628, now seen corresponding path program 1 times [2021-12-18 05:25:02,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:02,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3202726] [2021-12-18 05:25:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:02,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-18 05:25:03,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:03,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3202726] [2021-12-18 05:25:03,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3202726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:25:03,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:25:03,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 05:25:03,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288946474] [2021-12-18 05:25:03,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:25:03,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:25:03,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:03,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:25:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:25:03,236 INFO L87 Difference]: Start difference. First operand 1624 states and 2343 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-18 05:25:04,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:08,368 INFO L93 Difference]: Finished difference Result 2446 states and 3732 transitions. [2021-12-18 05:25:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 05:25:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 225 [2021-12-18 05:25:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:08,382 INFO L225 Difference]: With dead ends: 2446 [2021-12-18 05:25:08,383 INFO L226 Difference]: Without dead ends: 2444 [2021-12-18 05:25:08,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-18 05:25:08,385 INFO L933 BasicCegarLoop]: 2061 mSDtfsCounter, 2396 mSDsluCounter, 4279 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 1173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2485 SdHoareTripleChecker+Valid, 6340 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1173 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:08,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2485 Valid, 6340 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1173 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2021-12-18 05:25:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2021-12-18 05:25:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 1626. [2021-12-18 05:25:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1193 states have (on average 1.393964794635373) internal successors, (1663), 1226 states have internal predecessors, (1663), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:25:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2345 transitions. [2021-12-18 05:25:08,465 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2345 transitions. Word has length 225 [2021-12-18 05:25:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:08,466 INFO L470 AbstractCegarLoop]: Abstraction has 1626 states and 2345 transitions. [2021-12-18 05:25:08,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-18 05:25:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2345 transitions. [2021-12-18 05:25:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-12-18 05:25:08,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:08,472 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:08,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 05:25:08,473 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash -880059583, now seen corresponding path program 1 times [2021-12-18 05:25:08,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:08,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620274376] [2021-12-18 05:25:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:08,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 05:25:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-18 05:25:08,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:08,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620274376] [2021-12-18 05:25:08,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620274376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:25:08,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:25:08,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 05:25:08,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211104993] [2021-12-18 05:25:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:25:08,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:25:08,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:25:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:25:08,857 INFO L87 Difference]: Start difference. First operand 1626 states and 2345 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-18 05:25:11,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:13,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:15,262 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 [] [2021-12-18 05:25:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:18,013 INFO L93 Difference]: Finished difference Result 4028 states and 6019 transitions. [2021-12-18 05:25:18,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 05:25:18,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 235 [2021-12-18 05:25:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:18,029 INFO L225 Difference]: With dead ends: 4028 [2021-12-18 05:25:18,029 INFO L226 Difference]: Without dead ends: 2448 [2021-12-18 05:25:18,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-18 05:25:18,036 INFO L933 BasicCegarLoop]: 1778 mSDtfsCounter, 3428 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 1521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3700 SdHoareTripleChecker+Valid, 4624 SdHoareTripleChecker+Invalid, 4446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1521 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:18,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3700 Valid, 4624 Invalid, 4446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1521 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2021-12-18 05:25:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2021-12-18 05:25:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1627. [2021-12-18 05:25:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1194 states have (on average 1.3936348408710217) internal successors, (1664), 1227 states have internal predecessors, (1664), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:25:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2346 transitions. [2021-12-18 05:25:18,115 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2346 transitions. Word has length 235 [2021-12-18 05:25:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:18,115 INFO L470 AbstractCegarLoop]: Abstraction has 1627 states and 2346 transitions. [2021-12-18 05:25:18,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2021-12-18 05:25:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2346 transitions. [2021-12-18 05:25:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-12-18 05:25:18,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:18,144 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:18,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 05:25:18,145 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1720594174, now seen corresponding path program 1 times [2021-12-18 05:25:18,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:18,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790709297] [2021-12-18 05:25:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:18,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:25:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-18 05:25:18,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790709297] [2021-12-18 05:25:18,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790709297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:25:18,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:25:18,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 05:25:18,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862254855] [2021-12-18 05:25:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:25:18,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 05:25:18,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:18,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 05:25:18,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 05:25:18,466 INFO L87 Difference]: Start difference. First operand 1627 states and 2346 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-18 05:25:21,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:23,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:25,313 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 [] [2021-12-18 05:25:26,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:29,785 INFO L93 Difference]: Finished difference Result 3379 states and 5313 transitions. [2021-12-18 05:25:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 05:25:29,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 237 [2021-12-18 05:25:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:29,817 INFO L225 Difference]: With dead ends: 3379 [2021-12-18 05:25:29,818 INFO L226 Difference]: Without dead ends: 3377 [2021-12-18 05:25:29,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-12-18 05:25:29,822 INFO L933 BasicCegarLoop]: 2481 mSDtfsCounter, 3278 mSDsluCounter, 7910 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 1524 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3467 SdHoareTripleChecker+Valid, 10391 SdHoareTripleChecker+Invalid, 5565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1524 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:29,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3467 Valid, 10391 Invalid, 5565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1524 Valid, 4040 Invalid, 1 Unknown, 0 Unchecked, 11.1s Time] [2021-12-18 05:25:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2021-12-18 05:25:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 1629. [2021-12-18 05:25:29,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1195 states have (on average 1.393305439330544) internal successors, (1665), 1227 states have internal predecessors, (1665), 342 states have call successors, (342), 91 states have call predecessors, (342), 91 states have return successors, (342), 339 states have call predecessors, (342), 342 states have call successors, (342) [2021-12-18 05:25:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2349 transitions. [2021-12-18 05:25:29,925 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2349 transitions. Word has length 237 [2021-12-18 05:25:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:29,925 INFO L470 AbstractCegarLoop]: Abstraction has 1629 states and 2349 transitions. [2021-12-18 05:25:29,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-18 05:25:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2349 transitions. [2021-12-18 05:25:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-12-18 05:25:29,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:29,934 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:29,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 05:25:29,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2044074345, now seen corresponding path program 1 times [2021-12-18 05:25:29,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:29,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406570638] [2021-12-18 05:25:29,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:29,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:25:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2021-12-18 05:25:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-18 05:25:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-18 05:25:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2021-12-18 05:25:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2021-12-18 05:25:30,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406570638] [2021-12-18 05:25:30,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406570638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:25:30,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:25:30,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 05:25:30,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167057040] [2021-12-18 05:25:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:25:30,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 05:25:30,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 05:25:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 05:25:30,335 INFO L87 Difference]: Start difference. First operand 1629 states and 2349 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 05:25:33,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:38,029 INFO L93 Difference]: Finished difference Result 4088 states and 5965 transitions. [2021-12-18 05:25:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 05:25:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 267 [2021-12-18 05:25:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:38,043 INFO L225 Difference]: With dead ends: 4088 [2021-12-18 05:25:38,043 INFO L226 Difference]: Without dead ends: 2505 [2021-12-18 05:25:38,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-18 05:25:38,050 INFO L933 BasicCegarLoop]: 2113 mSDtfsCounter, 2475 mSDsluCounter, 2733 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 1114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1114 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:38,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2652 Valid, 4846 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1114 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2021-12-18 05:25:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2021-12-18 05:25:38,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2169. [2021-12-18 05:25:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 1584 states have (on average 1.3869949494949494) internal successors, (2197), 1625 states have internal predecessors, (2197), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2021-12-18 05:25:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3109 transitions. [2021-12-18 05:25:38,161 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3109 transitions. Word has length 267 [2021-12-18 05:25:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:38,162 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 3109 transitions. [2021-12-18 05:25:38,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 05:25:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3109 transitions. [2021-12-18 05:25:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2021-12-18 05:25:38,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:38,175 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:38,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 05:25:38,175 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 161296369, now seen corresponding path program 1 times [2021-12-18 05:25:38,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:38,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661449441] [2021-12-18 05:25:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:38,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:25:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2021-12-18 05:25:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2021-12-18 05:25:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-18 05:25:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-18 05:25:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2021-12-18 05:25:38,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:38,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661449441] [2021-12-18 05:25:38,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661449441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:25:38,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:25:38,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 05:25:38,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106570878] [2021-12-18 05:25:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:25:38,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:25:38,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:38,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:25:38,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:25:38,551 INFO L87 Difference]: Start difference. First operand 2169 states and 3109 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 05:25:41,025 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 [] [2021-12-18 05:25:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:44,037 INFO L93 Difference]: Finished difference Result 4678 states and 6957 transitions. [2021-12-18 05:25:44,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 05:25:44,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 269 [2021-12-18 05:25:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:44,054 INFO L225 Difference]: With dead ends: 4678 [2021-12-18 05:25:44,054 INFO L226 Difference]: Without dead ends: 3095 [2021-12-18 05:25:44,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-18 05:25:44,060 INFO L933 BasicCegarLoop]: 1992 mSDtfsCounter, 2754 mSDsluCounter, 4158 mSDsCounter, 0 mSdLazyCounter, 3523 mSolverCounterSat, 951 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3025 SdHoareTripleChecker+Valid, 6150 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 951 IncrementalHoareTripleChecker+Valid, 3523 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:44,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3025 Valid, 6150 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [951 Valid, 3523 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2021-12-18 05:25:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2021-12-18 05:25:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2173. [2021-12-18 05:25:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1588 states have (on average 1.3866498740554156) internal successors, (2202), 1629 states have internal predecessors, (2202), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2021-12-18 05:25:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3114 transitions. [2021-12-18 05:25:44,172 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3114 transitions. Word has length 269 [2021-12-18 05:25:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:44,173 INFO L470 AbstractCegarLoop]: Abstraction has 2173 states and 3114 transitions. [2021-12-18 05:25:44,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2021-12-18 05:25:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3114 transitions. [2021-12-18 05:25:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-12-18 05:25:44,184 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:44,184 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:44,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 05:25:44,185 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:44,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1663609119, now seen corresponding path program 1 times [2021-12-18 05:25:44,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:44,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090786427] [2021-12-18 05:25:44,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:44,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:25:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-18 05:25:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-18 05:25:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-18 05:25:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2021-12-18 05:25:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2021-12-18 05:25:44,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090786427] [2021-12-18 05:25:44,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090786427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:25:44,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:25:44,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 05:25:44,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256529991] [2021-12-18 05:25:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:25:44,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 05:25:44,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 05:25:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 05:25:44,501 INFO L87 Difference]: Start difference. First operand 2173 states and 3114 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-18 05:25:46,162 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 [] [2021-12-18 05:25:47,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:25:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:25:49,130 INFO L93 Difference]: Finished difference Result 4637 states and 6767 transitions. [2021-12-18 05:25:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 05:25:49,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 272 [2021-12-18 05:25:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:25:49,143 INFO L225 Difference]: With dead ends: 4637 [2021-12-18 05:25:49,144 INFO L226 Difference]: Without dead ends: 2510 [2021-12-18 05:25:49,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-18 05:25:49,153 INFO L933 BasicCegarLoop]: 1456 mSDtfsCounter, 2037 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 3533 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2021-12-18 05:25:49,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2091 Valid, 3533 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2021-12-18 05:25:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2021-12-18 05:25:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2173. [2021-12-18 05:25:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 1588 states have (on average 1.3809823677581865) internal successors, (2193), 1629 states have internal predecessors, (2193), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2021-12-18 05:25:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3105 transitions. [2021-12-18 05:25:49,301 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3105 transitions. Word has length 272 [2021-12-18 05:25:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:25:49,302 INFO L470 AbstractCegarLoop]: Abstraction has 2173 states and 3105 transitions. [2021-12-18 05:25:49,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2021-12-18 05:25:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3105 transitions. [2021-12-18 05:25:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-12-18 05:25:49,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:25:49,321 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:25:49,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 05:25:49,321 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:25:49,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:25:49,322 INFO L85 PathProgramCache]: Analyzing trace with hash 63515078, now seen corresponding path program 1 times [2021-12-18 05:25:49,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:25:49,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180064306] [2021-12-18 05:25:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:49,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:25:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:25:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:25:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:25:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:25:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:25:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:25:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:25:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:25:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:25:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:25:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:25:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:25:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:25:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:25:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:25:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:25:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:25:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:25:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:25:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:25:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-18 05:25:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-18 05:25:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-18 05:25:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-18 05:25:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2021-12-18 05:25:49,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:25:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180064306] [2021-12-18 05:25:49,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180064306] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:25:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280751801] [2021-12-18 05:25:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:25:49,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:25:49,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:25:49,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:25:49,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 05:25:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:25:50,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 1905 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 05:25:50,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:25:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2021-12-18 05:25:50,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:25:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2021-12-18 05:25:51,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280751801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:25:51,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 05:25:51,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2021-12-18 05:25:51,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336015209] [2021-12-18 05:25:51,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 05:25:51,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 05:25:51,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:25:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 05:25:51,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-18 05:25:51,392 INFO L87 Difference]: Start difference. First operand 2173 states and 3105 transitions. Second operand has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2021-12-18 05:25:55,189 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 [] [2021-12-18 05:25:57,218 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 [] [2021-12-18 05:26:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:26:02,157 INFO L93 Difference]: Finished difference Result 6435 states and 9898 transitions. [2021-12-18 05:26:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 05:26:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 275 [2021-12-18 05:26:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:26:02,182 INFO L225 Difference]: With dead ends: 6435 [2021-12-18 05:26:02,183 INFO L226 Difference]: Without dead ends: 4848 [2021-12-18 05:26:02,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-12-18 05:26:02,189 INFO L933 BasicCegarLoop]: 2513 mSDtfsCounter, 5567 mSDsluCounter, 7244 mSDsCounter, 0 mSdLazyCounter, 6326 mSolverCounterSat, 2447 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5961 SdHoareTripleChecker+Valid, 9757 SdHoareTripleChecker+Invalid, 8775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2447 IncrementalHoareTripleChecker+Valid, 6326 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:26:02,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5961 Valid, 9757 Invalid, 8775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2447 Valid, 6326 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2021-12-18 05:26:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2021-12-18 05:26:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 2180. [2021-12-18 05:26:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1595 states have (on average 1.380564263322884) internal successors, (2202), 1636 states have internal predecessors, (2202), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2021-12-18 05:26:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3114 transitions. [2021-12-18 05:26:02,331 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3114 transitions. Word has length 275 [2021-12-18 05:26:02,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:26:02,331 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 3114 transitions. [2021-12-18 05:26:02,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2021-12-18 05:26:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3114 transitions. [2021-12-18 05:26:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-12-18 05:26:02,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:26:02,342 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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] [2021-12-18 05:26:02,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 05:26:02,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-18 05:26:02,556 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:26:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:26:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1102205586, now seen corresponding path program 1 times [2021-12-18 05:26:02,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:26:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396506483] [2021-12-18 05:26:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:02,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:26:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:26:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:26:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:26:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:26:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:26:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:26:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:26:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:26:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:26:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:26:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:26:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:26:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:26:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:26:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:26:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:26:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:26:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-18 05:26:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-18 05:26:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-18 05:26:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-18 05:26:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-18 05:26:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2021-12-18 05:26:03,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:26:03,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396506483] [2021-12-18 05:26:03,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396506483] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:26:03,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223447524] [2021-12-18 05:26:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:03,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:26:03,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:26:03,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:26:03,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 05:26:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:03,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 05:26:03,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:26:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2021-12-18 05:26:04,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:26:04,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223447524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:26:04,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 05:26:04,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2021-12-18 05:26:04,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025246659] [2021-12-18 05:26:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:26:04,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:26:04,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:26:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:26:04,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-18 05:26:04,226 INFO L87 Difference]: Start difference. First operand 2180 states and 3114 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-18 05:26:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:26:04,603 INFO L93 Difference]: Finished difference Result 4704 states and 6894 transitions. [2021-12-18 05:26:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:26:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 284 [2021-12-18 05:26:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:26:04,617 INFO L225 Difference]: With dead ends: 4704 [2021-12-18 05:26:04,617 INFO L226 Difference]: Without dead ends: 3110 [2021-12-18 05:26:04,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-12-18 05:26:04,624 INFO L933 BasicCegarLoop]: 2264 mSDtfsCounter, 869 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 05:26:04,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 5968 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 05:26:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2021-12-18 05:26:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2182. [2021-12-18 05:26:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 1597 states have (on average 1.380087664370695) internal successors, (2204), 1638 states have internal predecessors, (2204), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2021-12-18 05:26:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3116 transitions. [2021-12-18 05:26:04,746 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3116 transitions. Word has length 284 [2021-12-18 05:26:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:26:04,747 INFO L470 AbstractCegarLoop]: Abstraction has 2182 states and 3116 transitions. [2021-12-18 05:26:04,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-12-18 05:26:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3116 transitions. [2021-12-18 05:26:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2021-12-18 05:26:04,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:26:04,760 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:26:04,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 05:26:04,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-18 05:26:04,976 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:26:04,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:26:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1865044058, now seen corresponding path program 1 times [2021-12-18 05:26:04,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:26:04,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344419361] [2021-12-18 05:26:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:04,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:26:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:26:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:26:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:26:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:26:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:26:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:26:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:26:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:26:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:26:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:26:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:26:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:26:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:26:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:26:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:26:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:26:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:26:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-18 05:26:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-18 05:26:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2021-12-18 05:26:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-18 05:26:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2021-12-18 05:26:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-18 05:26:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2021-12-18 05:26:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-12-18 05:26:05,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:26:05,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344419361] [2021-12-18 05:26:05,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344419361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:26:05,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:26:05,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 05:26:05,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089001871] [2021-12-18 05:26:05,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:26:05,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:26:05,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:26:05,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:26:05,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:26:05,284 INFO L87 Difference]: Start difference. First operand 2182 states and 3116 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-12-18 05:26:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:26:09,921 INFO L93 Difference]: Finished difference Result 4743 states and 7034 transitions. [2021-12-18 05:26:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 05:26:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 293 [2021-12-18 05:26:09,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:26:09,934 INFO L225 Difference]: With dead ends: 4743 [2021-12-18 05:26:09,934 INFO L226 Difference]: Without dead ends: 3147 [2021-12-18 05:26:09,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-18 05:26:09,939 INFO L933 BasicCegarLoop]: 1974 mSDtfsCounter, 3053 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 1713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3186 SdHoareTripleChecker+Valid, 5389 SdHoareTripleChecker+Invalid, 3976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1713 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:26:09,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3186 Valid, 5389 Invalid, 3976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1713 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2021-12-18 05:26:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2021-12-18 05:26:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2184. [2021-12-18 05:26:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1599 states have (on average 1.3796122576610381) internal successors, (2206), 1640 states have internal predecessors, (2206), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2021-12-18 05:26:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3118 transitions. [2021-12-18 05:26:10,067 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3118 transitions. Word has length 293 [2021-12-18 05:26:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:26:10,068 INFO L470 AbstractCegarLoop]: Abstraction has 2184 states and 3118 transitions. [2021-12-18 05:26:10,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2021-12-18 05:26:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3118 transitions. [2021-12-18 05:26:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-12-18 05:26:10,077 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:26:10,077 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:26:10,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 05:26:10,078 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:26:10,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:26:10,078 INFO L85 PathProgramCache]: Analyzing trace with hash -541847382, now seen corresponding path program 1 times [2021-12-18 05:26:10,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:26:10,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185894506] [2021-12-18 05:26:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:10,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:26:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:26:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:26:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:26:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:26:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:26:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:26:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:26:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:26:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:26:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:26:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:26:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:26:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:26:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:26:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:26:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:26:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:26:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-18 05:26:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-18 05:26:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2021-12-18 05:26:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-18 05:26:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-18 05:26:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2021-12-18 05:26:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2021-12-18 05:26:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-18 05:26:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2021-12-18 05:26:10,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:26:10,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185894506] [2021-12-18 05:26:10,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185894506] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:26:10,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865349769] [2021-12-18 05:26:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:10,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:26:10,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:26:10,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:26:10,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 05:26:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:11,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 2201 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 05:26:11,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:26:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2021-12-18 05:26:11,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:26:11,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865349769] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:26:11,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 05:26:11,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2021-12-18 05:26:11,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492769380] [2021-12-18 05:26:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:26:11,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 05:26:11,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:26:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 05:26:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2021-12-18 05:26:11,835 INFO L87 Difference]: Start difference. First operand 2184 states and 3118 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 05:26:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:26:12,319 INFO L93 Difference]: Finished difference Result 4878 states and 7157 transitions. [2021-12-18 05:26:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 05:26:12,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 301 [2021-12-18 05:26:12,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:26:12,331 INFO L225 Difference]: With dead ends: 4878 [2021-12-18 05:26:12,331 INFO L226 Difference]: Without dead ends: 3280 [2021-12-18 05:26:12,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-18 05:26:12,337 INFO L933 BasicCegarLoop]: 2302 mSDtfsCounter, 1175 mSDsluCounter, 8453 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 10755 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 05:26:12,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1278 Valid, 10755 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 05:26:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2021-12-18 05:26:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 2189. [2021-12-18 05:26:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2189 states, 1603 states have (on average 1.3786650031191516) internal successors, (2210), 1644 states have internal predecessors, (2210), 456 states have call successors, (456), 128 states have call predecessors, (456), 129 states have return successors, (460), 452 states have call predecessors, (460), 456 states have call successors, (460) [2021-12-18 05:26:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 3126 transitions. [2021-12-18 05:26:12,466 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 3126 transitions. Word has length 301 [2021-12-18 05:26:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:26:12,467 INFO L470 AbstractCegarLoop]: Abstraction has 2189 states and 3126 transitions. [2021-12-18 05:26:12,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 05:26:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 3126 transitions. [2021-12-18 05:26:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2021-12-18 05:26:12,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:26:12,476 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:26:12,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 05:26:12,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:26:12,692 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:26:12,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:26:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash 542215808, now seen corresponding path program 1 times [2021-12-18 05:26:12,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:26:12,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259551168] [2021-12-18 05:26:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:12,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:26:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:26:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:26:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:26:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:12,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:26:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:26:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:26:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:26:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 05:26:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-18 05:26:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-18 05:26:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-18 05:26:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:26:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-18 05:26:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2021-12-18 05:26:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-18 05:26:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2021-12-18 05:26:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2021-12-18 05:26:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-18 05:26:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2021-12-18 05:26:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-18 05:26:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2021-12-18 05:26:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-18 05:26:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2021-12-18 05:26:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-18 05:26:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-12-18 05:26:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2021-12-18 05:26:13,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:26:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259551168] [2021-12-18 05:26:13,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259551168] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:26:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694788609] [2021-12-18 05:26:13,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:13,241 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:26:13,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:26:13,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:26:13,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 05:26:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:14,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 2227 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 05:26:14,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:26:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2021-12-18 05:26:14,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:26:14,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694788609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:26:14,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 05:26:14,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2021-12-18 05:26:14,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013930400] [2021-12-18 05:26:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:26:14,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:26:14,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:26:14,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:26:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-12-18 05:26:14,453 INFO L87 Difference]: Start difference. First operand 2189 states and 3126 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-12-18 05:26:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:26:14,624 INFO L93 Difference]: Finished difference Result 4354 states and 6227 transitions. [2021-12-18 05:26:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:26:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 307 [2021-12-18 05:26:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:26:14,631 INFO L225 Difference]: With dead ends: 4354 [2021-12-18 05:26:14,631 INFO L226 Difference]: Without dead ends: 2190 [2021-12-18 05:26:14,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-18 05:26:14,639 INFO L933 BasicCegarLoop]: 1553 mSDtfsCounter, 3 mSDsluCounter, 3091 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4644 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:26:14,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 4644 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 05:26:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-12-18 05:26:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2190. [2021-12-18 05:26:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 1604 states have (on average 1.378428927680798) internal successors, (2211), 1645 states have internal predecessors, (2211), 456 states have call successors, (456), 128 states have call predecessors, (456), 129 states have return successors, (460), 452 states have call predecessors, (460), 456 states have call successors, (460) [2021-12-18 05:26:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3127 transitions. [2021-12-18 05:26:14,765 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3127 transitions. Word has length 307 [2021-12-18 05:26:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:26:14,766 INFO L470 AbstractCegarLoop]: Abstraction has 2190 states and 3127 transitions. [2021-12-18 05:26:14,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2021-12-18 05:26:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3127 transitions. [2021-12-18 05:26:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2021-12-18 05:26:14,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:26:14,775 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:26:14,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 05:26:14,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 05:26:14,992 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:26:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:26:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1987834062, now seen corresponding path program 1 times [2021-12-18 05:26:14,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:26:14,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055151962] [2021-12-18 05:26:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:14,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:26:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:26:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:26:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:26:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:26:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:26:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:26:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:26:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-18 05:26:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 05:26:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 05:26:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-18 05:26:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-18 05:26:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-18 05:26:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 05:26:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-18 05:26:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-18 05:26:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-18 05:26:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2021-12-18 05:26:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-18 05:26:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2021-12-18 05:26:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-18 05:26:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-18 05:26:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-18 05:26:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-18 05:26:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2021-12-18 05:26:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2021-12-18 05:26:15,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:26:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055151962] [2021-12-18 05:26:15,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055151962] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:26:15,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461984383] [2021-12-18 05:26:15,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:15,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:26:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:26:15,532 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:26:15,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 05:26:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 2332 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-18 05:26:16,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:26:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 180 proven. 13 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2021-12-18 05:26:17,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:26:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 521 trivial. 0 not checked. [2021-12-18 05:26:17,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461984383] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:26:17,790 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 05:26:17,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 22 [2021-12-18 05:26:17,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876697897] [2021-12-18 05:26:17,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 05:26:17,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-18 05:26:17,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:26:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-18 05:26:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-12-18 05:26:17,792 INFO L87 Difference]: Start difference. First operand 2190 states and 3127 transitions. Second operand has 22 states, 22 states have (on average 8.090909090909092) internal successors, (178), 13 states have internal predecessors, (178), 2 states have call successors, (66), 7 states have call predecessors, (66), 6 states have return successors, (46), 6 states have call predecessors, (46), 2 states have call successors, (46) [2021-12-18 05:26:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:26:31,055 INFO L93 Difference]: Finished difference Result 4284 states and 6215 transitions. [2021-12-18 05:26:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 05:26:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.090909090909092) internal successors, (178), 13 states have internal predecessors, (178), 2 states have call successors, (66), 7 states have call predecessors, (66), 6 states have return successors, (46), 6 states have call predecessors, (46), 2 states have call successors, (46) Word has length 314 [2021-12-18 05:26:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:26:31,089 INFO L225 Difference]: With dead ends: 4284 [2021-12-18 05:26:31,089 INFO L226 Difference]: Without dead ends: 2673 [2021-12-18 05:26:31,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 707 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=1495, Unknown=0, NotChecked=0, Total=1806 [2021-12-18 05:26:31,094 INFO L933 BasicCegarLoop]: 1533 mSDtfsCounter, 4794 mSDsluCounter, 10811 mSDsCounter, 0 mSdLazyCounter, 11130 mSolverCounterSat, 2870 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4894 SdHoareTripleChecker+Valid, 12344 SdHoareTripleChecker+Invalid, 14000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2870 IncrementalHoareTripleChecker+Valid, 11130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2021-12-18 05:26:31,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4894 Valid, 12344 Invalid, 14000 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2870 Valid, 11130 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2021-12-18 05:26:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2021-12-18 05:26:31,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2206. [2021-12-18 05:26:31,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 1615 states have (on average 1.3758513931888545) internal successors, (2222), 1658 states have internal predecessors, (2222), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:26:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3154 transitions. [2021-12-18 05:26:31,232 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3154 transitions. Word has length 314 [2021-12-18 05:26:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:26:31,233 INFO L470 AbstractCegarLoop]: Abstraction has 2206 states and 3154 transitions. [2021-12-18 05:26:31,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.090909090909092) internal successors, (178), 13 states have internal predecessors, (178), 2 states have call successors, (66), 7 states have call predecessors, (66), 6 states have return successors, (46), 6 states have call predecessors, (46), 2 states have call successors, (46) [2021-12-18 05:26:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3154 transitions. [2021-12-18 05:26:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2021-12-18 05:26:31,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:26:31,242 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:26:31,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 05:26:31,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 05:26:31,457 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:26:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:26:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -697893468, now seen corresponding path program 2 times [2021-12-18 05:26:31,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:26:31,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851634984] [2021-12-18 05:26:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:26:31,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:26:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:26:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:26:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:26:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:26:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:26:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:26:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:26:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-18 05:26:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-18 05:26:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 05:26:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-18 05:26:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-18 05:26:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-18 05:26:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 05:26:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-18 05:26:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-18 05:26:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:26:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:26:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2021-12-18 05:26:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-18 05:26:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:26:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2021-12-18 05:26:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2021-12-18 05:26:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2021-12-18 05:26:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-18 05:26:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-18 05:26:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 303 [2021-12-18 05:26:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2021-12-18 05:26:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:26:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2021-12-18 05:26:32,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:26:32,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851634984] [2021-12-18 05:26:32,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851634984] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:26:32,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298890463] [2021-12-18 05:26:32,040 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 05:26:32,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:26:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:26:32,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:26:32,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 05:27:07,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 05:27:07,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:27:07,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 2358 conjuncts, 178 conjunts are in the unsatisfiable core [2021-12-18 05:27:07,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:27:07,624 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 05:27:07,816 INFO L388 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 [2021-12-18 05:27:07,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 05:27:07,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 05:27:08,054 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 05:27:08,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 05:27:08,125 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 05:27:08,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 05:27:08,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-12-18 05:27:08,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-12-18 05:27:08,252 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-12-18 05:27:08,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-12-18 05:27:08,495 INFO L354 Elim1Store]: treesize reduction 64, result has 34.7 percent of original size [2021-12-18 05:27:08,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 45 [2021-12-18 05:27:08,835 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 05:27:08,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2021-12-18 05:27:08,872 INFO L388 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 [2021-12-18 05:27:08,948 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-18 05:27:08,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2021-12-18 05:27:09,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 05:27:09,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-18 05:27:09,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 05:27:09,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 05:27:09,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2021-12-18 05:27:09,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2021-12-18 05:27:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 05:27:09,609 INFO L354 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2021-12-18 05:27:09,610 INFO L388 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 [2021-12-18 05:27:09,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2021-12-18 05:27:09,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2021-12-18 05:27:09,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2021-12-18 05:27:09,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2021-12-18 05:27:09,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:09,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2021-12-18 05:27:09,903 INFO L388 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 [2021-12-18 05:27:09,908 INFO L388 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 [2021-12-18 05:27:09,912 INFO L388 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 25 treesize of output 25 [2021-12-18 05:27:10,051 INFO L354 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2021-12-18 05:27:10,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 40 [2021-12-18 05:27:10,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-12-18 05:27:10,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:10,107 INFO L388 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 [2021-12-18 05:27:10,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:10,114 INFO L388 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 [2021-12-18 05:27:10,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2021-12-18 05:27:10,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 05:27:10,408 INFO L354 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2021-12-18 05:27:10,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2021-12-18 05:27:10,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:10,420 INFO L388 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 [2021-12-18 05:27:10,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:10,425 INFO L388 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 [2021-12-18 05:27:10,789 INFO L354 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2021-12-18 05:27:10,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2021-12-18 05:27:10,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:10,803 INFO L388 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 [2021-12-18 05:27:10,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:10,809 INFO L388 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 [2021-12-18 05:27:11,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:11,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:11,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:11,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 444 treesize of output 258 [2021-12-18 05:27:11,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:11,321 INFO L354 Elim1Store]: treesize reduction 59, result has 21.3 percent of original size [2021-12-18 05:27:11,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 385 treesize of output 252 [2021-12-18 05:27:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:27:11,335 INFO L388 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 206 treesize of output 176 [2021-12-18 05:27:11,341 INFO L388 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 170 treesize of output 154 [2021-12-18 05:27:11,345 INFO L388 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 167 treesize of output 131 [2021-12-18 05:27:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 143 proven. 32 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2021-12-18 05:27:11,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:27:11,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3230 (Array Int Int)) (v_ArrVal_3228 (Array Int Int)) (v_ArrVal_3229 (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_3230) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_3228) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_3229) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1) 112))) 4294967296))) (or (<= .cse0 0) (< 2147483647 .cse0)))) is different from false [2021-12-18 05:27:11,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298890463] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:27:11,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 05:27:11,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 38] total 46 [2021-12-18 05:27:11,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463906539] [2021-12-18 05:27:11,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 05:27:11,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-18 05:27:11,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:27:11,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-18 05:27:11,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1948, Unknown=1, NotChecked=88, Total=2162 [2021-12-18 05:27:11,499 INFO L87 Difference]: Start difference. First operand 2206 states and 3154 transitions. Second operand has 46 states, 45 states have (on average 5.777777777777778) internal successors, (260), 35 states have internal predecessors, (260), 14 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (56), 16 states have call predecessors, (56), 14 states have call successors, (56) [2021-12-18 05:27:16,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:27:20,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:27:21,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:27:24,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:27:25,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:27:27,434 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 [] [2021-12-18 05:27:29,694 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 [] [2021-12-18 05:27:45,477 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 [] [2021-12-18 05:28:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:28:24,845 INFO L93 Difference]: Finished difference Result 14215 states and 23464 transitions. [2021-12-18 05:28:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-12-18 05:28:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 5.777777777777778) internal successors, (260), 35 states have internal predecessors, (260), 14 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (56), 16 states have call predecessors, (56), 14 states have call successors, (56) Word has length 320 [2021-12-18 05:28:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:28:24,898 INFO L225 Difference]: With dead ends: 14215 [2021-12-18 05:28:24,899 INFO L226 Difference]: Without dead ends: 12033 [2021-12-18 05:28:24,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 380 SyntacticMatches, 18 SemanticMatches, 151 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7343 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1356, Invalid=21599, Unknown=1, NotChecked=300, Total=23256 [2021-12-18 05:28:24,917 INFO L933 BasicCegarLoop]: 4740 mSDtfsCounter, 11002 mSDsluCounter, 99178 mSDsCounter, 0 mSdLazyCounter, 90445 mSolverCounterSat, 7731 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11275 SdHoareTripleChecker+Valid, 103918 SdHoareTripleChecker+Invalid, 123924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 7731 IncrementalHoareTripleChecker+Valid, 90445 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 25745 IncrementalHoareTripleChecker+Unchecked, 68.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:28:24,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11275 Valid, 103918 Invalid, 123924 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [7731 Valid, 90445 Invalid, 3 Unknown, 25745 Unchecked, 68.0s Time] [2021-12-18 05:28:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12033 states. [2021-12-18 05:28:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12033 to 6574. [2021-12-18 05:28:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6574 states, 5019 states have (on average 1.4534767882048216) internal successors, (7295), 5169 states have internal predecessors, (7295), 1310 states have call successors, (1310), 218 states have call predecessors, (1310), 244 states have return successors, (1600), 1269 states have call predecessors, (1600), 1310 states have call successors, (1600) [2021-12-18 05:28:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6574 states to 6574 states and 10205 transitions. [2021-12-18 05:28:25,639 INFO L78 Accepts]: Start accepts. Automaton has 6574 states and 10205 transitions. Word has length 320 [2021-12-18 05:28:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:28:25,640 INFO L470 AbstractCegarLoop]: Abstraction has 6574 states and 10205 transitions. [2021-12-18 05:28:25,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 5.777777777777778) internal successors, (260), 35 states have internal predecessors, (260), 14 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (56), 16 states have call predecessors, (56), 14 states have call successors, (56) [2021-12-18 05:28:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states and 10205 transitions. [2021-12-18 05:28:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2021-12-18 05:28:25,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:28:25,674 INFO L514 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:28:25,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 05:28:25,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 05:28:25,901 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:28:25,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:28:25,901 INFO L85 PathProgramCache]: Analyzing trace with hash -332125059, now seen corresponding path program 1 times [2021-12-18 05:28:25,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:28:25,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315317006] [2021-12-18 05:28:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:28:25,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:28:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:28:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:28:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:28:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:28:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:28:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:28:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:28:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 05:28:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 05:28:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-18 05:28:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:28:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 05:28:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 05:28:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-18 05:28:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2021-12-18 05:28:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2021-12-18 05:28:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-12-18 05:28:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2021-12-18 05:28:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-18 05:28:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2021-12-18 05:28:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2021-12-18 05:28:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-18 05:28:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2021-12-18 05:28:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2021-12-18 05:28:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-18 05:28:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2021-12-18 05:28:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2021-12-18 05:28:26,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:28:26,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315317006] [2021-12-18 05:28:26,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315317006] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:28:26,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761495321] [2021-12-18 05:28:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:28:26,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:28:26,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:28:26,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:28:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 05:28:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:27,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 2447 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 05:28:27,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:28:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2021-12-18 05:28:27,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:28:27,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761495321] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:28:27,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 05:28:27,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2021-12-18 05:28:27,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971819569] [2021-12-18 05:28:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:28:27,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 05:28:27,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:28:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 05:28:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-12-18 05:28:27,826 INFO L87 Difference]: Start difference. First operand 6574 states and 10205 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2021-12-18 05:28:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:28:28,677 INFO L93 Difference]: Finished difference Result 17890 states and 27848 transitions. [2021-12-18 05:28:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 05:28:28,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 329 [2021-12-18 05:28:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:28:28,726 INFO L225 Difference]: With dead ends: 17890 [2021-12-18 05:28:28,727 INFO L226 Difference]: Without dead ends: 11853 [2021-12-18 05:28:28,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-12-18 05:28:28,752 INFO L933 BasicCegarLoop]: 3012 mSDtfsCounter, 1485 mSDsluCounter, 7557 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 10569 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:28:28,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 10569 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 05:28:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2021-12-18 05:28:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 9129. [2021-12-18 05:28:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9129 states, 6814 states have (on average 1.421191664220722) internal successors, (9684), 7044 states have internal predecessors, (9684), 1887 states have call successors, (1887), 387 states have call predecessors, (1887), 427 states have return successors, (2187), 1830 states have call predecessors, (2187), 1887 states have call successors, (2187) [2021-12-18 05:28:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9129 states to 9129 states and 13758 transitions. [2021-12-18 05:28:29,623 INFO L78 Accepts]: Start accepts. Automaton has 9129 states and 13758 transitions. Word has length 329 [2021-12-18 05:28:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:28:29,623 INFO L470 AbstractCegarLoop]: Abstraction has 9129 states and 13758 transitions. [2021-12-18 05:28:29,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 3 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2021-12-18 05:28:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9129 states and 13758 transitions. [2021-12-18 05:28:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2021-12-18 05:28:29,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:28:29,657 INFO L514 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:28:29,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 05:28:29,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:28:29,872 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:28:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:28:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash 109829332, now seen corresponding path program 1 times [2021-12-18 05:28:29,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:28:29,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255519534] [2021-12-18 05:28:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:28:29,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:28:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:28:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:28:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:28:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:28:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:28:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:28:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:28:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-18 05:28:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-18 05:28:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-18 05:28:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-18 05:28:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-18 05:28:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 05:28:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-18 05:28:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 05:28:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-18 05:28:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2021-12-18 05:28:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2021-12-18 05:28:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2021-12-18 05:28:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2021-12-18 05:28:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2021-12-18 05:28:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2021-12-18 05:28:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2021-12-18 05:28:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-18 05:28:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-18 05:28:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-12-18 05:28:30,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:28:30,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255519534] [2021-12-18 05:28:30,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255519534] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:28:30,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496011740] [2021-12-18 05:28:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:28:30,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:28:30,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:28:30,467 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:28:30,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 05:28:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:32,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 05:28:32,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:28:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 268 proven. 3 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-18 05:28:32,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:28:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2021-12-18 05:28:33,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496011740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:28:33,572 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 05:28:33,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 18 [2021-12-18 05:28:33,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099828598] [2021-12-18 05:28:33,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 05:28:33,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 05:28:33,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:28:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 05:28:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-12-18 05:28:33,574 INFO L87 Difference]: Start difference. First operand 9129 states and 13758 transitions. Second operand has 18 states, 18 states have (on average 10.5) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2021-12-18 05:28:37,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:28:39,818 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 [] [2021-12-18 05:28:40,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:28:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:28:45,356 INFO L93 Difference]: Finished difference Result 19486 states and 29723 transitions. [2021-12-18 05:28:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 05:28:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 10.5) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 328 [2021-12-18 05:28:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:28:45,403 INFO L225 Difference]: With dead ends: 19486 [2021-12-18 05:28:45,403 INFO L226 Difference]: Without dead ends: 10376 [2021-12-18 05:28:45,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 732 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2021-12-18 05:28:45,431 INFO L933 BasicCegarLoop]: 1466 mSDtfsCounter, 2295 mSDsluCounter, 6753 mSDsCounter, 0 mSdLazyCounter, 6361 mSolverCounterSat, 1450 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 8219 SdHoareTripleChecker+Invalid, 7812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1450 IncrementalHoareTripleChecker+Valid, 6361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2021-12-18 05:28:45,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2319 Valid, 8219 Invalid, 7812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1450 Valid, 6361 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2021-12-18 05:28:45,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10376 states. [2021-12-18 05:28:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10376 to 9135. [2021-12-18 05:28:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9135 states, 6820 states have (on average 1.4211143695014663) internal successors, (9692), 7050 states have internal predecessors, (9692), 1887 states have call successors, (1887), 387 states have call predecessors, (1887), 427 states have return successors, (2187), 1830 states have call predecessors, (2187), 1887 states have call successors, (2187) [2021-12-18 05:28:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9135 states to 9135 states and 13766 transitions. [2021-12-18 05:28:46,211 INFO L78 Accepts]: Start accepts. Automaton has 9135 states and 13766 transitions. Word has length 328 [2021-12-18 05:28:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:28:46,212 INFO L470 AbstractCegarLoop]: Abstraction has 9135 states and 13766 transitions. [2021-12-18 05:28:46,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.5) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2021-12-18 05:28:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9135 states and 13766 transitions. [2021-12-18 05:28:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2021-12-18 05:28:46,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:28:46,240 INFO L514 BasicCegarLoop]: trace histogram [22, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:28:46,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 05:28:46,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:28:46,468 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:28:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:28:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash 284096148, now seen corresponding path program 2 times [2021-12-18 05:28:46,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:28:46,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946737601] [2021-12-18 05:28:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:28:46,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:28:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:28:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:28:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:28:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:28:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:28:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:28:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:28:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 05:28:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 05:28:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-18 05:28:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-18 05:28:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-18 05:28:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-18 05:28:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-18 05:28:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2021-12-18 05:28:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2021-12-18 05:28:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:28:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:28:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2021-12-18 05:28:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2021-12-18 05:28:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:28:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2021-12-18 05:28:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2021-12-18 05:28:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2021-12-18 05:28:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2021-12-18 05:28:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-18 05:28:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-18 05:28:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2021-12-18 05:28:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:28:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 26 proven. 47 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2021-12-18 05:28:46,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:28:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946737601] [2021-12-18 05:28:46,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946737601] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:28:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860163301] [2021-12-18 05:28:46,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 05:28:46,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:28:46,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:28:46,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:28:46,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 05:29:49,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 05:29:49,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:29:49,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2591 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-18 05:29:49,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:29:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 461 proven. 47 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2021-12-18 05:29:49,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:29:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 26 proven. 47 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2021-12-18 05:29:50,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860163301] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:29:50,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 05:29:50,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 16 [2021-12-18 05:29:50,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567723957] [2021-12-18 05:29:50,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 05:29:50,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 05:29:50,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:29:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 05:29:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-18 05:29:50,423 INFO L87 Difference]: Start difference. First operand 9135 states and 13766 transitions. Second operand has 16 states, 16 states have (on average 11.9375) internal successors, (191), 11 states have internal predecessors, (191), 2 states have call successors, (72), 7 states have call predecessors, (72), 5 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2021-12-18 05:29:53,486 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 [] [2021-12-18 05:29:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:29:57,150 INFO L93 Difference]: Finished difference Result 19480 states and 29707 transitions. [2021-12-18 05:29:57,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 05:29:57,151 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.9375) internal successors, (191), 11 states have internal predecessors, (191), 2 states have call successors, (72), 7 states have call predecessors, (72), 5 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 338 [2021-12-18 05:29:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:29:57,194 INFO L225 Difference]: With dead ends: 19480 [2021-12-18 05:29:57,194 INFO L226 Difference]: Without dead ends: 10374 [2021-12-18 05:29:57,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 755 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2021-12-18 05:29:57,222 INFO L933 BasicCegarLoop]: 1466 mSDtfsCounter, 1850 mSDsluCounter, 4548 mSDsCounter, 0 mSdLazyCounter, 4240 mSolverCounterSat, 1165 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 6014 SdHoareTripleChecker+Invalid, 5406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1165 IncrementalHoareTripleChecker+Valid, 4240 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2021-12-18 05:29:57,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1874 Valid, 6014 Invalid, 5406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1165 Valid, 4240 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2021-12-18 05:29:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2021-12-18 05:29:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 9136. [2021-12-18 05:29:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9136 states, 6821 states have (on average 1.4207594194399649) internal successors, (9691), 7051 states have internal predecessors, (9691), 1887 states have call successors, (1887), 387 states have call predecessors, (1887), 427 states have return successors, (2187), 1830 states have call predecessors, (2187), 1887 states have call successors, (2187) [2021-12-18 05:29:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 13765 transitions. [2021-12-18 05:29:58,101 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 13765 transitions. Word has length 338 [2021-12-18 05:29:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:29:58,102 INFO L470 AbstractCegarLoop]: Abstraction has 9136 states and 13765 transitions. [2021-12-18 05:29:58,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.9375) internal successors, (191), 11 states have internal predecessors, (191), 2 states have call successors, (72), 7 states have call predecessors, (72), 5 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2021-12-18 05:29:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 13765 transitions. [2021-12-18 05:29:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2021-12-18 05:29:58,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:29:58,135 INFO L514 BasicCegarLoop]: trace histogram [28, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:29:58,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 05:29:58,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:29:58,360 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:29:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:29:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1155032472, now seen corresponding path program 3 times [2021-12-18 05:29:58,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:29:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087967083] [2021-12-18 05:29:58,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:29:58,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:29:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:29:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:29:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:29:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:29:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:29:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:29:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:29:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:29:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 05:29:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 05:29:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-18 05:29:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 05:29:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 05:29:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 05:29:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 05:29:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:29:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-18 05:29:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-12-18 05:29:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:29:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:29:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2021-12-18 05:29:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2021-12-18 05:29:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:29:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2021-12-18 05:29:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2021-12-18 05:29:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2021-12-18 05:29:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2021-12-18 05:29:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2021-12-18 05:29:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2021-12-18 05:29:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2021-12-18 05:29:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:29:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 56 proven. 122 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2021-12-18 05:29:59,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:29:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087967083] [2021-12-18 05:29:59,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087967083] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:29:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900645084] [2021-12-18 05:29:59,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 05:29:59,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:29:59,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:29:59,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:29:59,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 05:31:11,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 05:31:11,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:31:11,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-18 05:31:11,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:31:12,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-18 05:31:12,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-18 05:31:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1020 trivial. 0 not checked. [2021-12-18 05:31:12,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:31:12,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900645084] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:31:12,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 05:31:12,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2021-12-18 05:31:12,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302137359] [2021-12-18 05:31:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:31:12,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 05:31:12,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:31:12,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 05:31:12,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-12-18 05:31:12,268 INFO L87 Difference]: Start difference. First operand 9136 states and 13765 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2021-12-18 05:31:17,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:31:19,365 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 [] [2021-12-18 05:31:24,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:31:24,230 INFO L93 Difference]: Finished difference Result 41562 states and 66709 transitions. [2021-12-18 05:31:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 05:31:24,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 344 [2021-12-18 05:31:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:31:24,366 INFO L225 Difference]: With dead ends: 41562 [2021-12-18 05:31:24,366 INFO L226 Difference]: Without dead ends: 33033 [2021-12-18 05:31:24,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2021-12-18 05:31:24,407 INFO L933 BasicCegarLoop]: 3463 mSDtfsCounter, 4518 mSDsluCounter, 12538 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 1320 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4721 SdHoareTripleChecker+Valid, 16001 SdHoareTripleChecker+Invalid, 4186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1320 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:31:24,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4721 Valid, 16001 Invalid, 4186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1320 Valid, 2865 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2021-12-18 05:31:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33033 states. [2021-12-18 05:31:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33033 to 13454. [2021-12-18 05:31:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13454 states, 10011 states have (on average 1.4209369693337328) internal successors, (14225), 10375 states have internal predecessors, (14225), 2703 states have call successors, (2703), 683 states have call predecessors, (2703), 739 states have return successors, (3243), 2556 states have call predecessors, (3243), 2703 states have call successors, (3243) [2021-12-18 05:31:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13454 states to 13454 states and 20171 transitions. [2021-12-18 05:31:26,032 INFO L78 Accepts]: Start accepts. Automaton has 13454 states and 20171 transitions. Word has length 344 [2021-12-18 05:31:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:31:26,033 INFO L470 AbstractCegarLoop]: Abstraction has 13454 states and 20171 transitions. [2021-12-18 05:31:26,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2021-12-18 05:31:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13454 states and 20171 transitions. [2021-12-18 05:31:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2021-12-18 05:31:26,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:31:26,079 INFO L514 BasicCegarLoop]: trace histogram [28, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:31:26,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 05:31:26,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 05:31:26,296 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:31:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:31:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -92387807, now seen corresponding path program 1 times [2021-12-18 05:31:26,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:31:26,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718717187] [2021-12-18 05:31:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:31:26,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:31:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:31:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:31:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:31:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:31:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:31:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:31:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:31:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:31:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 05:31:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 05:31:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-18 05:31:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 05:31:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 05:31:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 05:31:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 05:31:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:31:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-18 05:31:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-12-18 05:31:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-18 05:31:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2021-12-18 05:31:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2021-12-18 05:31:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:31:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2021-12-18 05:31:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2021-12-18 05:31:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2021-12-18 05:31:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2021-12-18 05:31:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2021-12-18 05:31:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2021-12-18 05:31:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2021-12-18 05:31:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2021-12-18 05:31:26,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:31:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718717187] [2021-12-18 05:31:26,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718717187] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:31:26,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319589314] [2021-12-18 05:31:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:31:26,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:31:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:31:26,792 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:31:26,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 05:31:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:27,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 05:31:27,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:31:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2021-12-18 05:31:28,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:31:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2021-12-18 05:31:28,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319589314] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:31:28,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 05:31:28,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 5] total 15 [2021-12-18 05:31:28,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533140389] [2021-12-18 05:31:28,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 05:31:28,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 05:31:28,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:31:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 05:31:28,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-18 05:31:28,996 INFO L87 Difference]: Start difference. First operand 13454 states and 20171 transitions. Second operand has 15 states, 15 states have (on average 17.2) internal successors, (258), 10 states have internal predecessors, (258), 7 states have call successors, (86), 8 states have call predecessors, (86), 3 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2021-12-18 05:31:32,362 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 [] [2021-12-18 05:31:33,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:31:35,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:31:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:31:44,340 INFO L93 Difference]: Finished difference Result 46129 states and 74497 transitions. [2021-12-18 05:31:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 05:31:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 10 states have internal predecessors, (258), 7 states have call successors, (86), 8 states have call predecessors, (86), 3 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) Word has length 353 [2021-12-18 05:31:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:31:44,516 INFO L225 Difference]: With dead ends: 46129 [2021-12-18 05:31:44,516 INFO L226 Difference]: Without dead ends: 33282 [2021-12-18 05:31:44,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2021-12-18 05:31:44,571 INFO L933 BasicCegarLoop]: 1843 mSDtfsCounter, 5810 mSDsluCounter, 6978 mSDsCounter, 0 mSdLazyCounter, 9999 mSolverCounterSat, 2872 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6220 SdHoareTripleChecker+Valid, 8821 SdHoareTripleChecker+Invalid, 12872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2872 IncrementalHoareTripleChecker+Valid, 9999 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:31:44,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6220 Valid, 8821 Invalid, 12872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2872 Valid, 9999 Invalid, 1 Unknown, 0 Unchecked, 12.3s Time] [2021-12-18 05:31:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2021-12-18 05:31:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 13784. [2021-12-18 05:31:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13784 states, 10239 states have (on average 1.4174235765211447) internal successors, (14513), 10633 states have internal predecessors, (14513), 2755 states have call successors, (2755), 683 states have call predecessors, (2755), 789 states have return successors, (3537), 2618 states have call predecessors, (3537), 2755 states have call successors, (3537) [2021-12-18 05:31:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13784 states to 13784 states and 20805 transitions. [2021-12-18 05:31:46,033 INFO L78 Accepts]: Start accepts. Automaton has 13784 states and 20805 transitions. Word has length 353 [2021-12-18 05:31:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:31:46,033 INFO L470 AbstractCegarLoop]: Abstraction has 13784 states and 20805 transitions. [2021-12-18 05:31:46,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.2) internal successors, (258), 10 states have internal predecessors, (258), 7 states have call successors, (86), 8 states have call predecessors, (86), 3 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2021-12-18 05:31:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13784 states and 20805 transitions. [2021-12-18 05:31:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2021-12-18 05:31:46,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:31:46,072 INFO L514 BasicCegarLoop]: trace histogram [28, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:31:46,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 05:31:46,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-18 05:31:46,273 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:31:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:31:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 611153152, now seen corresponding path program 1 times [2021-12-18 05:31:46,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:31:46,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133241940] [2021-12-18 05:31:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:31:46,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:31:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:31:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-18 05:31:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 05:31:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-18 05:31:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-18 05:31:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-18 05:31:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 05:31:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-18 05:31:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-18 05:31:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-18 05:31:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-18 05:31:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 05:31:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 05:31:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 05:31:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2021-12-18 05:31:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:31:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-18 05:31:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2021-12-18 05:31:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 05:31:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-18 05:31:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2021-12-18 05:31:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2021-12-18 05:31:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2021-12-18 05:31:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 05:31:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2021-12-18 05:31:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2021-12-18 05:31:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2021-12-18 05:31:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2021-12-18 05:31:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2021-12-18 05:31:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2021-12-18 05:31:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2021-12-18 05:31:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 56 proven. 122 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2021-12-18 05:31:46,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 05:31:46,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133241940] [2021-12-18 05:31:46,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133241940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 05:31:46,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977356806] [2021-12-18 05:31:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:31:46,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 05:31:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:31:46,936 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 05:31:46,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 05:31:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:31:50,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2723 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 05:31:50,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:31:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 588 proven. 46 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2021-12-18 05:31:51,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:31:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 56 proven. 122 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2021-12-18 05:31:51,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977356806] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:31:51,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 05:31:51,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 27 [2021-12-18 05:31:51,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235165011] [2021-12-18 05:31:51,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 05:31:51,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-18 05:31:51,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 05:31:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-18 05:31:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2021-12-18 05:31:51,758 INFO L87 Difference]: Start difference. First operand 13784 states and 20805 transitions. Second operand has 27 states, 27 states have (on average 7.555555555555555) internal successors, (204), 22 states have internal predecessors, (204), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2021-12-18 05:32:04,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:04,391 INFO L93 Difference]: Finished difference Result 29014 states and 44163 transitions. [2021-12-18 05:32:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-18 05:32:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.555555555555555) internal successors, (204), 22 states have internal predecessors, (204), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 355 [2021-12-18 05:32:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:04,452 INFO L225 Difference]: With dead ends: 29014 [2021-12-18 05:32:04,453 INFO L226 Difference]: Without dead ends: 15252 [2021-12-18 05:32:04,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 782 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2021-12-18 05:32:04,488 INFO L933 BasicCegarLoop]: 1466 mSDtfsCounter, 2237 mSDsluCounter, 8973 mSDsCounter, 0 mSdLazyCounter, 8547 mSolverCounterSat, 1465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2261 SdHoareTripleChecker+Valid, 10439 SdHoareTripleChecker+Invalid, 10012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1465 IncrementalHoareTripleChecker+Valid, 8547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:04,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2261 Valid, 10439 Invalid, 10012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1465 Valid, 8547 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2021-12-18 05:32:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15252 states. [2021-12-18 05:32:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15252 to 13788. [2021-12-18 05:32:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13788 states, 10243 states have (on average 1.4171629405447623) internal successors, (14516), 10637 states have internal predecessors, (14516), 2755 states have call successors, (2755), 683 states have call predecessors, (2755), 789 states have return successors, (3537), 2618 states have call predecessors, (3537), 2755 states have call successors, (3537) [2021-12-18 05:32:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13788 states to 13788 states and 20808 transitions. [2021-12-18 05:32:05,497 INFO L78 Accepts]: Start accepts. Automaton has 13788 states and 20808 transitions. Word has length 355 [2021-12-18 05:32:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:05,498 INFO L470 AbstractCegarLoop]: Abstraction has 13788 states and 20808 transitions. [2021-12-18 05:32:05,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.555555555555555) internal successors, (204), 22 states have internal predecessors, (204), 2 states have call successors, (74), 7 states have call predecessors, (74), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2021-12-18 05:32:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 13788 states and 20808 transitions. [2021-12-18 05:32:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2021-12-18 05:32:05,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:05,534 INFO L514 BasicCegarLoop]: trace histogram [36, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:32:05,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:05,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-18 05:32:05,735 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1865820160, now seen corresponding path program 2 times [2021-12-18 05:32:05,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 05:32:05,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712770255] [2021-12-18 05:32:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:05,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 05:32:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 05:32:07,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 05:32:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 05:32:08,605 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 05:32:08,605 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 05:32:08,606 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 05:32:08,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-18 05:32:08,610 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:32:08,615 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 05:32:08,662 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,663 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,664 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,665 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,666 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,667 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,668 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,669 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,671 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,672 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,673 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,674 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,675 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,676 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,677 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,678 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,679 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,680 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,681 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,682 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,683 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,684 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,685 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,686 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,687 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,688 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,689 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,690 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-18 05:32:08,691 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-18 05:32:08,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:32:08 BoogieIcfgContainer [2021-12-18 05:32:08,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 05:32:08,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 05:32:08,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 05:32:08,921 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 05:32:08,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:24:38" (3/4) ... [2021-12-18 05:32:08,924 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 05:32:08,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 05:32:08,925 INFO L158 Benchmark]: Toolchain (without parser) took 455059.57ms. Allocated memory was 96.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 54.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 702.0MB. Max. memory is 16.1GB. [2021-12-18 05:32:08,925 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 53.7MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 05:32:08,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1508.56ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 54.4MB in the beginning and 82.6MB in the end (delta: -28.1MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2021-12-18 05:32:08,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 182.87ms. Allocated memory is still 132.1MB. Free memory was 81.9MB in the beginning and 65.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-18 05:32:08,926 INFO L158 Benchmark]: Boogie Preprocessor took 210.73ms. Allocated memory is still 132.1MB. Free memory was 65.1MB in the beginning and 47.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-18 05:32:08,926 INFO L158 Benchmark]: RCFGBuilder took 2650.87ms. Allocated memory was 132.1MB in the beginning and 209.7MB in the end (delta: 77.6MB). Free memory was 47.6MB in the beginning and 81.1MB in the end (delta: -33.4MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2021-12-18 05:32:08,931 INFO L158 Benchmark]: TraceAbstraction took 450495.07ms. Allocated memory was 209.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 81.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-12-18 05:32:08,934 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 05:32:08,935 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 53.8MB in the beginning and 53.7MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1508.56ms. Allocated memory was 96.5MB in the beginning and 132.1MB in the end (delta: 35.7MB). Free memory was 54.4MB in the beginning and 82.6MB in the end (delta: -28.1MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 182.87ms. Allocated memory is still 132.1MB. Free memory was 81.9MB in the beginning and 65.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 210.73ms. Allocated memory is still 132.1MB. Free memory was 65.1MB in the beginning and 47.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2650.87ms. Allocated memory was 132.1MB in the beginning and 209.7MB in the end (delta: 77.6MB). Free memory was 47.6MB in the beginning and 81.1MB in the end (delta: -33.4MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 450495.07ms. Allocated memory was 209.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 81.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 1.9GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7652]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4943, overapproximation of bitwiseAnd at line 4722. Possible FailurePath: [L4947] int LDV_IN_INTERRUPT = 1; [L4948] int ldv_timer_state_2 = 0; [L4949] int ldv_state_variable_0 ; [L4950] struct tty_struct *sl_ldisc_group1 ; [L4951] int ldv_state_variable_3 ; [L4952] struct timer_list *ldv_timer_list_2 ; [L4953] int ldv_timer_state_1 = 0; [L4954] int ldv_state_variable_2 ; [L4955] int ref_cnt ; [L4956] int ldv_state_variable_1 ; [L4957] struct timer_list *ldv_timer_list_1 ; [L4958] struct net_device *sl_netdev_ops_group1 ; [L4959] int ldv_state_variable_4 ; [L5145] static struct net_device **slip_devs ; [L5146] static int slip_maxdev = 256; [L5961-L5964] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6833-L6836] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L7015] int ldv_retval_0 ; [L7016] int ldv_retval_1 ; [L7019] int ldv_retval_3 ; [L7020] int ldv_retval_2 ; VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L7135] struct sk_buff *ldvarg1 ; [L7136] void *tmp ; [L7137] struct ifreq *ldvarg4 ; [L7138] void *tmp___0 ; [L7139] int ldvarg3 ; [L7140] struct rtnl_link_stats64 *ldvarg0 ; [L7141] void *tmp___1 ; [L7142] int ldvarg2 ; [L7143] unsigned long ldvarg11 ; [L7144] struct file *ldvarg7 ; [L7145] unsigned int ldvarg12 ; [L7146] unsigned long ldvarg5 ; [L7147] unsigned int ldvarg6 ; [L7148] int ldvarg8 ; [L7149] struct file *ldvarg13 ; [L7150] unsigned char *ldvarg10 ; [L7151] void *tmp___4 ; [L7152] char *ldvarg9 ; [L7153] void *tmp___5 ; [L7154] int tmp___6 ; [L7155] int tmp___7 ; [L7156] int tmp___8 ; [L7157] int tmp___9 ; VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L7159] CALL, EXPR ldv_init_zalloc(240UL) VAL [\old(size)=240, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=240, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=240, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={18446744073709551617:0}, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=240, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={18446744073709551617:0}, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}] [L4780] return (p); VAL [\old(size)=240, \result={18446744073709551617:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={18446744073709551617:0}, ref_cnt=0, size=240, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}] [L7159] RET, EXPR ldv_init_zalloc(240UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(240UL)={18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L7159] tmp = ldv_init_zalloc(240UL) [L7160] ldvarg1 = (struct sk_buff *)tmp VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}] [L7161] CALL, EXPR ldv_init_zalloc(40UL) VAL [\old(size)=40, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=40, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=40, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={36893488147419103233:0}, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103233:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=40, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={36893488147419103233:0}, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103233:0}] [L4780] return (p); VAL [\old(size)=40, \result={36893488147419103233:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={36893488147419103233:0}, ref_cnt=0, size=40, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103233:0}] [L7161] RET, EXPR ldv_init_zalloc(40UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(40UL)={36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}] [L7161] tmp___0 = ldv_init_zalloc(40UL) [L7162] ldvarg4 = (struct ifreq *)tmp___0 VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}] [L7163] CALL, EXPR ldv_init_zalloc(184UL) VAL [\old(size)=184, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=184, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=184, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=184, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L4780] return (p); VAL [\old(size)=184, \result={-18446744073709551617:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=184, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-18446744073709551617:0}] [L7163] RET, EXPR ldv_init_zalloc(184UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(184UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}] [L7163] tmp___1 = ldv_init_zalloc(184UL) [L7164] ldvarg0 = (struct rtnl_link_stats64 *)tmp___1 VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}] [L7165] CALL, EXPR ldv_malloc(sizeof(struct file)) VAL [\old(size)=316, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND TRUE tmp___0 != 0 [L4746] return ((void *)0); VAL [\old(size)=316, \result={0:0}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=316, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp___0=1] [L7165] RET, EXPR ldv_malloc(sizeof(struct file)) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct file))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}] [L7165] ldvarg7 = ldv_malloc(sizeof(struct file)) [L7166] CALL, EXPR ldv_malloc(sizeof(struct file)) VAL [\old(size)=316, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND TRUE tmp___0 != 0 [L4746] return ((void *)0); VAL [\old(size)=316, \result={0:0}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=316, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp___0=1] [L7166] RET, EXPR ldv_malloc(sizeof(struct file)) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct file))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}] [L7166] ldvarg13 = ldv_malloc(sizeof(struct file)) [L7167] CALL, EXPR ldv_init_zalloc(1UL) VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103233:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103233:0}] [L4780] return (p); VAL [\old(size)=1, \result={-36893488147419103233:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-36893488147419103233:0}] [L7167] RET, EXPR ldv_init_zalloc(1UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1UL)={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}] [L7167] tmp___4 = ldv_init_zalloc(1UL) [L7168] ldvarg10 = (unsigned char *)tmp___4 VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}] [L7169] CALL, EXPR ldv_init_zalloc(1UL) VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-73786976294838206463:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-73786976294838206463:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206463:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206463:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-73786976294838206463:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206463:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206463:0}] [L4780] return (p); VAL [\old(size)=1, \result={-73786976294838206463:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-73786976294838206463:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206463:0}, ref_cnt=0, size=1, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206463:0}] [L7169] RET, EXPR ldv_init_zalloc(1UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1UL)={-73786976294838206463:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}] [L7169] tmp___5 = ldv_init_zalloc(1UL) [L7170] ldvarg9 = (char *)tmp___5 [L7171] FCALL ldv_initialize() [L7172] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={36893488147419103237:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={36893488147419103237:0}, s={36893488147419103237:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103237:0}] [L7172] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg3), 0, 4UL)={36893488147419103237:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7173] CALL ldv_memset((void *)(& ldvarg2), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={36893488147419103245:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={36893488147419103245:0}, s={36893488147419103245:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103245:0}] [L7173] RET ldv_memset((void *)(& ldvarg2), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg2), 0, 4UL)={36893488147419103245:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7174] CALL ldv_memset((void *)(& ldvarg11), 0, 8UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={36893488147419103239:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=8, ref_cnt=0, s={36893488147419103239:0}, s={36893488147419103239:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103239:0}] [L7174] RET ldv_memset((void *)(& ldvarg11), 0, 8UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg11), 0, 8UL)={36893488147419103239:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7175] CALL ldv_memset((void *)(& ldvarg12), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={36893488147419103248:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={36893488147419103248:0}, s={36893488147419103248:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103248:0}] [L7175] RET ldv_memset((void *)(& ldvarg12), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg12), 0, 4UL)={36893488147419103248:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7176] CALL ldv_memset((void *)(& ldvarg5), 0, 8UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={36893488147419103236:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=8, ref_cnt=0, s={36893488147419103236:0}, s={36893488147419103236:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103236:0}] [L7176] RET ldv_memset((void *)(& ldvarg5), 0, 8UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg5), 0, 8UL)={36893488147419103236:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7177] CALL ldv_memset((void *)(& ldvarg6), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={36893488147419103244:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={36893488147419103244:0}, s={36893488147419103244:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103244:0}] [L7177] RET ldv_memset((void *)(& ldvarg6), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg6), 0, 4UL)={36893488147419103244:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7178] CALL ldv_memset((void *)(& ldvarg8), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4785] void *tmp ; [L4787] EXPR, FCALL memset(s, c, n) [L4787] tmp = memset(s, c, n) [L4788] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={36893488147419103241:0}, __this_module={36893488147419103263:36893488147419103264}, c=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, n=4, ref_cnt=0, s={36893488147419103241:0}, s={36893488147419103241:0}, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={36893488147419103241:0}] [L7178] RET ldv_memset((void *)(& ldvarg8), 0, 4UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg8), 0, 4UL)={36893488147419103241:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7179] ldv_state_variable_4 = 0 [L7180] ldv_state_variable_1 = 1 [L7181] ref_cnt = 0 [L7182] ldv_state_variable_0 = 1 [L7183] ldv_state_variable_3 = 0 [L7184] ldv_state_variable_2 = 1 VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}] [L7186] tmp___6 = __VERIFIER_nondet_int() [L7188] case 0: [L7305] case 1: [L7311] case 2: VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}, tmp___6=2] [L7312] COND TRUE ldv_state_variable_0 != 0 [L7313] tmp___8 = __VERIFIER_nondet_int() [L7315] case 0: [L7323] case 1: VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}, tmp___6=2, tmp___8=1] [L7324] COND TRUE ldv_state_variable_0 == 1 [L7325] CALL, EXPR slip_init() [L6839] int status ; [L6840] void *tmp ; VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L6842] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L6850] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4941] void *tmp ; VAL [\old(flags)=208, \old(size)=2048, __this_module={36893488147419103263:36893488147419103264}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4943] CALL, EXPR kmalloc(size, flags | 32768U) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4932] void *tmp___2 ; [L4934] CALL, EXPR __kmalloc(size, flags) [L4927] CALL, EXPR ldv_malloc(size) VAL [\old(size)=2048, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND FALSE !(tmp___0 != 0) [L4748] tmp = malloc(size) [L4749] p = tmp VAL [\old(size)=2048, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206465:0}, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206465:0}, tmp___0=0] [L4750] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4750] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2048, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206465:0}, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206465:0}, tmp___0=0] [L4751] return (p); VAL [\old(size)=2048, \result={-73786976294838206465:0}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-73786976294838206465:0}, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206465:0}, tmp___0=0] [L4927] RET, EXPR ldv_malloc(size) VAL [\old(size)=2048, \old(t)=48, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, t=48] [L4927] return ldv_malloc(size); [L4934] RET, EXPR __kmalloc(size, flags) [L4934] tmp___2 = __kmalloc(size, flags) [L4935] return (tmp___2); VAL [\old(flags)=48, \old(size)=2048, \result={-73786976294838206465:0}, __this_module={36893488147419103263:36893488147419103264}, flags=48, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-73786976294838206465:0}] [L4943] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=2048, __this_module={36893488147419103263:36893488147419103264}, flags=208, kmalloc(size, flags | 32768U)={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256] [L4943] tmp = kmalloc(size, flags | 32768U) [L4944] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-73786976294838206465:0}, __this_module={36893488147419103263:36893488147419103264}, flags=208, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2048, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-73786976294838206465:0}] [L6850] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6850] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6851] slip_devs = (struct net_device **)tmp VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-73786976294838206465:0}] [L6852] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6857] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7801] return __VERIFIER_nondet_int(); [L6857] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6857] status = tty_register_ldisc(1, & sl_ldisc) [L6858] COND FALSE !(status != 0) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, status=0, tmp={-73786976294838206465:0}] [L6863] return (status); VAL [\result=0, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, status=0, tmp={-73786976294838206465:0}] [L7325] RET, EXPR slip_init() [L7325] ldv_retval_2 = slip_init() [L7326] COND FALSE !(ldv_retval_2 != 0) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=0, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}, tmp___6=2, tmp___8=1] [L7331] COND TRUE ldv_retval_2 == 0 [L7332] ldv_state_variable_0 = 2 [L7333] ldv_state_variable_3 = 1 [L7334] CALL ldv_target_type_3() [L7023] void *tmp ; VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7025] CALL, EXPR ldv_init_zalloc(2696UL) VAL [\old(size)=2696, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=2696, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=2696, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-92233720368547758081:0}, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2696, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-92233720368547758081:0}, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L4780] return (p); VAL [\old(size)=2696, \result={-92233720368547758081:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-92233720368547758081:0}, ref_cnt=0, size=2696, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L7025] RET, EXPR ldv_init_zalloc(2696UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(2696UL)={-92233720368547758081:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={0:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7025] tmp = ldv_init_zalloc(2696UL) [L7026] sl_ldisc_group1 = (struct tty_struct *)tmp VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=0, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-92233720368547758081:0}] [L7334] RET ldv_target_type_3() [L7335] ldv_state_variable_4 = 1 [L7336] CALL ldv_net_device_ops_4() [L7032] void *tmp ; VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7034] CALL, EXPR ldv_init_zalloc(2496UL) VAL [\old(size)=2496, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4774] void *p ; [L4775] void *tmp ; [L4777] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=2496, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4777] tmp = calloc(1UL, size) [L4778] p = tmp VAL [\old(size)=2496, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-110680464442257309697:0}, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L4779] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4779] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2496, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-110680464442257309697:0}, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L4780] return (p); VAL [\old(size)=2496, \result={-110680464442257309697:0}, __this_module={36893488147419103263:36893488147419103264}, calloc(1UL, size)={-110680464442257309697:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-110680464442257309697:0}, ref_cnt=0, size=2496, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L7034] RET, EXPR ldv_init_zalloc(2496UL) VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(2496UL)={-110680464442257309697:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={0:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7034] tmp = ldv_init_zalloc(2496UL) [L7035] sl_netdev_ops_group1 = (struct net_device *)tmp VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-110680464442257309697:0}] [L7336] RET ldv_net_device_ops_4() [L7186] tmp___6 = __VERIFIER_nondet_int() [L7188] case 0: [L7305] case 1: [L7311] case 2: [L7349] case 3: VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}, tmp___6=3, tmp___8=1] [L7350] COND TRUE ldv_state_variable_3 != 0 [L7351] tmp___9 = __VERIFIER_nondet_int() [L7353] case 0: [L7365] case 1: [L7377] case 2: [L7385] case 3: [L7392] case 4: VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={18446744073709551617:0}, ldvarg10={-36893488147419103233:0}, ldvarg11={36893488147419103239:0}, ldvarg12={36893488147419103248:0}, ldvarg13={0:0}, ldvarg2={36893488147419103245:0}, ldvarg3={36893488147419103237:0}, ldvarg4={36893488147419103233:0}, ldvarg5={36893488147419103236:0}, ldvarg6={36893488147419103244:0}, ldvarg7={0:0}, ldvarg8={36893488147419103241:0}, ldvarg9={-73786976294838206463:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={18446744073709551617:0}, tmp___0={36893488147419103233:0}, tmp___1={-18446744073709551617:0}, tmp___4={-36893488147419103233:0}, tmp___5={-73786976294838206463:0}, tmp___6=3, tmp___8=1, tmp___9=4] [L7393] COND TRUE ldv_state_variable_3 == 1 [L7394] CALL ldv_slip_open_18(sl_ldisc_group1) [L7639] ldv_func_ret_type___16 ldv_func_res ; [L7640] int tmp ; [L7642] CALL, EXPR slip_open(tty) [L6147] struct slip *sl ; [L6148] int err ; [L6149] int tmp ; [L6150] dev_t tmp___0 ; [L6151] struct task_struct *tmp___1 ; [L6152] int tmp___2 ; [L6154] CALL, EXPR capable(12) [L7695] return __VERIFIER_nondet_int(); [L6154] RET, EXPR capable(12) [L6154] tmp = capable(12) [L6155] COND FALSE !(tmp == 0) [L6159] EXPR tty->ops [L6159] EXPR (tty->ops)->write VAL [(tty->ops)->write={-42:43}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, tty->ops={36893488147419103268:-3}] [L6159-L6161] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L6165] FCALL rtnl_lock() [L6166] CALL sl_sync() [L6036] int i ; [L6037] struct net_device *dev ; [L6038] struct slip *sl ; [L6039] void *tmp ; [L6041] i = 0 VAL [__this_module={36893488147419103263:36893488147419103264}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6062] COND TRUE i < slip_maxdev VAL [__this_module={36893488147419103263:36893488147419103264}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6044] EXPR slip_devs + (unsigned long )i [L6044] dev = *(slip_devs + (unsigned long )i) [L6045] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) VAL [__this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6049] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L5014] return ((void *)dev + 2496U); VAL [\result={2507:-10}, __this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, dev={2507:-2506}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6049] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, netdev_priv((struct net_device const *)dev)={2507:-10}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6049] tmp = netdev_priv((struct net_device const *)dev) [L6050] sl = (struct slip *)tmp [L6051] EXPR sl->tty [L6051] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [(unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U=1, __this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2507:-10}, sl->tty={47:-46}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={2507:-10}] [L6051] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L6060] i = i + 1 VAL [__this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2507:-10}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={2507:-10}] [L6062] COND TRUE i < slip_maxdev VAL [__this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2507:-10}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={2507:-10}] [L6044] EXPR slip_devs + (unsigned long )i [L6044] dev = *(slip_devs + (unsigned long )i) [L6045] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={36893488147419103263:36893488147419103264}, dev={29:18446744073709551587}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={2507:-10}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={2507:-10}] [L6166] RET sl_sync() [L6167] EXPR tty->disc_data [L6167] sl = (struct slip *)tty->disc_data [L6168] err = -17 [L6169] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6169] EXPR sl->magic [L6169] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [(unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250=0, __this_module={36893488147419103263:36893488147419103264}, err=-17, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={49:-48}, sl->magic=-2, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6169] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6173] err = -23 VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={49:-48}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6174] CALL, EXPR tty_devnum(tty) VAL [__this_module={36893488147419103263:36893488147419103264}, arg0={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7790] return __VERIFIER_nondet_uint(); [L6174] RET, EXPR tty_devnum(tty) VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl={49:-48}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, tty_devnum(tty)=36893488147419103265] [L6174] tmp___0 = tty_devnum(tty) [L6175] CALL, EXPR sl_alloc(tmp___0) [L6072] int i ; [L6073] struct net_device *dev ; [L6074] struct slip *sl ; [L6075] void *tmp ; [L6076] int tmp___0 ; [L6077] char name[16U] ; [L6078] void *tmp___1 ; [L6079] struct lock_class_key __key ; [L6081] dev = (struct net_device *)0 VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6082] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6086] i = 0 VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6096] COND TRUE i < slip_maxdev VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={0:0}, i=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6089] EXPR slip_devs + (unsigned long )i [L6089] dev = *(slip_devs + (unsigned long )i) [L6090] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6094] i = i + 1 VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6096] COND TRUE i < slip_maxdev VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={2507:-2506}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6089] EXPR slip_devs + (unsigned long )i [L6089] dev = *(slip_devs + (unsigned long )i) [L6090] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={29:18446744073709551587}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6101] COND FALSE !(i >= slip_maxdev) VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={29:18446744073709551587}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6105] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={29:18446744073709551587}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6117] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L6119] CALL, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L7691] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(size)=2255, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4740] void *p ; [L4741] void *tmp ; [L4742] int tmp___0 ; [L4744] tmp___0 = __VERIFIER_nondet_int() [L4745] COND FALSE !(tmp___0 != 0) [L4748] tmp = malloc(size) [L4749] p = tmp VAL [\old(size)=2255, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551615:0}, ref_cnt=0, size=2255, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-18446744073709551615:0}, tmp___0=0] [L4750] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4736] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={36893488147419103263:36893488147419103264}, cond=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4750] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2255, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551615:0}, ref_cnt=0, size=2255, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-18446744073709551615:0}, tmp___0=0] [L4751] return (p); VAL [\old(size)=2255, \result={-18446744073709551615:0}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, p={-18446744073709551615:0}, ref_cnt=0, size=2255, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp={-18446744073709551615:0}, tmp___0=0] [L7691] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=472, \old(arg3)=1, \old(arg4)=1, __this_module={36893488147419103263:36893488147419103264}, arg0=472, arg1={36893488147419103235:0}, arg1={36893488147419103235:0}, arg2={-1:10}, arg2={-1:10}, arg3=1, arg4=1, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7691] return ldv_malloc(sizeof(struct net_device)); [L6119] RET, EXPR alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6119] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6120] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6124] dev->base_addr = (unsigned long )i VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6127] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L5014] return ((void *)dev + 2496U); VAL [\result={-18446744073709551615:2496}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, dev={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6127] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, netdev_priv((struct net_device const *)dev)={-18446744073709551615:2496}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6127] tmp___1 = netdev_priv((struct net_device const *)dev) [L6128] sl = (struct slip *)tmp___1 [L6129] sl->magic = 21250 [L6130] sl->dev = dev [L6131] CALL spinlock_check(& sl->lock) [L4871] return (& lock->__annonCompField19.rlock); VAL [\result={-18446744073709551615:2516}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, lock={-18446744073709551615:2516}, lock={-18446744073709551615:2516}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6131] RET spinlock_check(& sl->lock) [L6132-L6133] FCALL __raw_spin_lock_init(& sl->lock.__annonCompField19.rlock, "&(&sl->lock)->rlock", & __key) [L6134] sl->mode = 8U VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6135] CALL reg_timer_1(& sl->keepalive_timer) VAL [\old(ldv_timer_list_1)=0, \old(ldv_timer_list_1)=0, \old(ldv_timer_state_1)=0, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={0:0}, ldv_timer_list_2={0:0}, ldv_timer_state_1=0, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, timer={-18446744073709551615:2812}] [L7070] ldv_timer_list_1 = timer [L7071] ldv_timer_state_1 = 1 [L7072] return (0); VAL [\old(ldv_timer_list_1)=0, \old(ldv_timer_list_1)=0, \old(ldv_timer_state_1)=0, \result=0, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, timer={-18446744073709551615:2812}, timer={-18446744073709551615:2812}] [L6135] RET reg_timer_1(& sl->keepalive_timer) VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, reg_timer_1(& sl->keepalive_timer)=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6136] sl->keepalive_timer.data = (unsigned long )sl [L6137] sl->keepalive_timer.function = & sl_keepalive VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6138] CALL reg_timer_1(& sl->outfill_timer) VAL [\old(ldv_timer_list_1)=2812, \old(ldv_timer_list_1)=-18446744073709551615, \old(ldv_timer_state_1)=1, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2812}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, timer={-18446744073709551615:2688}] [L7070] ldv_timer_list_1 = timer [L7071] ldv_timer_state_1 = 1 [L7072] return (0); VAL [\old(ldv_timer_list_1)=-18446744073709551615, \old(ldv_timer_list_1)=2812, \old(ldv_timer_state_1)=1, \result=0, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, timer={-18446744073709551615:2688}, timer={-18446744073709551615:2688}] [L6138] RET reg_timer_1(& sl->outfill_timer) VAL [\old(line)=33, __key={36893488147419103256:0}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=33, name={36893488147419103235:0}, ref_cnt=0, reg_timer_1(& sl->outfill_timer)=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6139] sl->outfill_timer.data = (unsigned long )sl [L6140] sl->outfill_timer.function = & sl_outfill [L6141] *(slip_devs + (unsigned long )i) = dev [L6142] return (sl); [L6142] return (sl); [L6142] return (sl); VAL [\old(line)=33, \result={-18446744073709551615:2496}, __this_module={36893488147419103263:36893488147419103264}, dev={-18446744073709551615:0}, i=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, line=33, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp___1={-18446744073709551615:2496}] [L6175] RET, EXPR sl_alloc(tmp___0) [L6175] sl = sl_alloc(tmp___0) [L6176] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6180] sl->tty = tty [L6181] tty->disc_data = (void *)sl VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6182] CALL, EXPR tty_devnum(tty) VAL [__this_module={36893488147419103263:36893488147419103264}, arg0={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L7790] return __VERIFIER_nondet_uint(); [L6182] RET, EXPR tty_devnum(tty) VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, tty_devnum(tty)=36893488147419103274] [L6182] sl->line = tty_devnum(tty) [L6183] CALL, EXPR get_current() VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4839] struct task_struct *pfo_ret__ ; [L4842] case 1UL: [L4845] case 2UL: [L4848] case 4UL: [L4851] case 8UL: VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4858] return (pfo_ret__); VAL [\result={36893488147419103284:-4}, __this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, pfo_ret__={36893488147419103284:-4}, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L6183] RET, EXPR get_current() VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, get_current()={36893488147419103284:-4}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6183] tmp___1 = get_current() [L6184] EXPR tmp___1->pid [L6184] sl->pid = tmp___1->pid [L6185] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [\old(nr)=0, __this_module={36893488147419103263:36893488147419103264}, addr={-18446744073709551615:2668}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] [L4722] EXPR addr + (unsigned long )(nr / 64U) [L4722] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6185] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) VAL [__this_module={36893488147419103263:36893488147419103264}, constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags))=-5, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tmp___1={36893488147419103284:-4}, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6185] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6186] COND FALSE !(tmp___2 == 0) VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tmp___1={36893488147419103284:-4}, tmp___2=-5, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6200] EXPR sl->keepalive VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl->keepalive=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tmp___1={36893488147419103284:-4}, tmp___2=-5, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6200] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6205] EXPR sl->outfill VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl->outfill=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tmp___1={36893488147419103284:-4}, tmp___2=-5, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6205] COND FALSE !((unsigned int )sl->outfill != 0U) [L6210] FCALL rtnl_unlock() VAL [__this_module={36893488147419103263:36893488147419103264}, err=-23, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl={-18446744073709551615:2496}, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256, tmp=1, tmp___0=33, tmp___1={36893488147419103284:-4}, tmp___2=-5, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}] [L6211] tty->receive_room = 65536U [L6212] EXPR sl->dev [L6212] EXPR (sl->dev)->base_addr [L6212] return ((int )(sl->dev)->base_addr); [L7642] RET, EXPR slip_open(tty) [L7642] tmp = slip_open(tty) [L7643] ldv_func_res = tmp [L7644] CALL ldv_check_callback_ret_val(ldv_func_res) [L7658] COND TRUE ret_val > 0 [L7659] CALL ldv_error() [L7652] reach_error() VAL [__this_module={36893488147419103263:36893488147419103264}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_state_variable_4=1, ldv_timer_list_1={-18446744073709551615:2688}, ldv_timer_list_2={0:0}, ldv_timer_state_1=1, ldv_timer_state_2=0, ref_cnt=0, sl_ldisc={27:0}, sl_ldisc_group1={-92233720368547758081:0}, sl_netdev_ops={26:0}, sl_netdev_ops_group1={-110680464442257309697:0}, slip_devs={-73786976294838206465:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 54 procedures, 1107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 450.1s, OverallIterations: 24, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.4s, AutomataDifference: 228.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 71618 SdHoareTripleChecker+Valid, 207.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68414 mSDsluCounter, 264908 SdHoareTripleChecker+Invalid, 188.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 25745 IncrementalHoareTripleChecker+Unchecked, 217452 mSDsCounter, 34588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166892 IncrementalHoareTripleChecker+Invalid, 227236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34588 mSolverCounterUnsat, 47456 mSDtfsCounter, 166892 mSolverCounterSat, 1.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7999 GetRequests, 7453 SyntacticMatches, 24 SemanticMatches, 522 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9084 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13788occurred in iteration=23, InterpolantAutomatonStates: 366, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 63128 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 178.2s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 10623 NumberOfCodeBlocks, 10445 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 12182 ConstructedInterpolants, 42 QuantifiedInterpolants, 23664 SizeOfPredicates, 100 NumberOfNonLiveVariables, 27357 ConjunctsInSsa, 398 ConjunctsInUnsatCore, 41 InterpolantComputations, 16 PerfectInterpolantSequences, 24499/25366 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 05:32:08,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 05:32:10,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 05:32:10,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 05:32:11,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 05:32:11,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 05:32:11,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 05:32:11,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 05:32:11,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 05:32:11,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 05:32:11,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 05:32:11,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 05:32:11,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 05:32:11,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 05:32:11,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 05:32:11,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 05:32:11,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 05:32:11,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 05:32:11,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 05:32:11,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 05:32:11,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 05:32:11,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 05:32:11,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 05:32:11,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 05:32:11,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 05:32:11,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 05:32:11,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 05:32:11,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 05:32:11,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 05:32:11,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 05:32:11,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 05:32:11,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 05:32:11,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 05:32:11,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 05:32:11,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 05:32:11,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 05:32:11,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 05:32:11,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 05:32:11,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 05:32:11,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 05:32:11,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 05:32:11,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 05:32:11,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-18 05:32:11,126 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 05:32:11,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 05:32:11,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 05:32:11,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 05:32:11,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 05:32:11,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 05:32:11,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 05:32:11,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 05:32:11,131 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 05:32:11,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 05:32:11,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 05:32:11,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 05:32:11,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 05:32:11,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 05:32:11,133 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 05:32:11,133 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 05:32:11,133 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 05:32:11,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 05:32:11,133 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 05:32:11,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 05:32:11,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 05:32:11,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 05:32:11,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 05:32:11,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 05:32:11,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 05:32:11,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 05:32:11,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 05:32:11,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 05:32:11,135 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 05:32:11,135 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 05:32:11,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 05:32:11,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 05:32:11,136 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 05:32:11,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 05:32:11,136 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2021-12-18 05:32:11,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 05:32:11,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 05:32:11,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 05:32:11,527 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 05:32:11,528 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 05:32:11,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-12-18 05:32:11,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39a2ee21/2b3673721fda4763bafb740d6ff774e8/FLAGf9362d9f6 [2021-12-18 05:32:12,330 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 05:32:12,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-12-18 05:32:12,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39a2ee21/2b3673721fda4763bafb740d6ff774e8/FLAGf9362d9f6 [2021-12-18 05:32:12,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b39a2ee21/2b3673721fda4763bafb740d6ff774e8 [2021-12-18 05:32:12,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 05:32:12,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 05:32:12,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 05:32:12,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 05:32:12,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 05:32:12,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:32:12" (1/1) ... [2021-12-18 05:32:12,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a59975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:12, skipping insertion in model container [2021-12-18 05:32:12,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:32:12" (1/1) ... [2021-12-18 05:32:12,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 05:32:12,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 05:32:14,034 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-12-18 05:32:14,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 05:32:14,092 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 05:32:14,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 05:32:14,351 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-12-18 05:32:14,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 05:32:14,378 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 05:32:14,630 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.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2021-12-18 05:32:14,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 05:32:14,730 INFO L208 MainTranslator]: Completed translation [2021-12-18 05:32:14,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14 WrapperNode [2021-12-18 05:32:14,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 05:32:14,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 05:32:14,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 05:32:14,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 05:32:14,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:14,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:14,871 INFO L137 Inliner]: procedures = 200, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3099 [2021-12-18 05:32:14,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 05:32:14,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 05:32:14,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 05:32:14,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 05:32:14,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:14,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:14,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:14,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:14,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:15,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:15,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:15,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 05:32:15,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 05:32:15,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 05:32:15,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 05:32:15,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (1/1) ... [2021-12-18 05:32:15,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 05:32:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 05:32:15,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 05:32:15,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 05:32:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2021-12-18 05:32:15,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2021-12-18 05:32:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-18 05:32:15,132 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2021-12-18 05:32:15,133 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2021-12-18 05:32:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-12-18 05:32:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-12-18 05:32:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 05:32:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 05:32:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 05:32:15,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-18 05:32:15,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-18 05:32:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-12-18 05:32:15,134 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-12-18 05:32:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2021-12-18 05:32:15,134 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2021-12-18 05:32:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 05:32:15,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 05:32:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2021-12-18 05:32:15,135 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2021-12-18 05:32:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-12-18 05:32:15,135 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-12-18 05:32:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 05:32:15,135 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 05:32:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-18 05:32:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-18 05:32:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2021-12-18 05:32:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2021-12-18 05:32:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2021-12-18 05:32:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2021-12-18 05:32:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-12-18 05:32:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-12-18 05:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 05:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2021-12-18 05:32:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2021-12-18 05:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2021-12-18 05:32:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2021-12-18 05:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 05:32:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2021-12-18 05:32:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2021-12-18 05:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2021-12-18 05:32:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2021-12-18 05:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-12-18 05:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-18 05:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-12-18 05:32:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 05:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 05:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2021-12-18 05:32:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2021-12-18 05:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 05:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-12-18 05:32:15,139 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-12-18 05:32:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 05:32:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-12-18 05:32:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2021-12-18 05:32:15,140 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2021-12-18 05:32:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-18 05:32:15,140 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-18 05:32:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 05:32:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 05:32:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 05:32:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 05:32:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2021-12-18 05:32:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2021-12-18 05:32:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2021-12-18 05:32:15,141 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2021-12-18 05:32:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2021-12-18 05:32:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2021-12-18 05:32:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2021-12-18 05:32:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2021-12-18 05:32:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-18 05:32:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-18 05:32:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2021-12-18 05:32:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2021-12-18 05:32:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2021-12-18 05:32:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2021-12-18 05:32:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 05:32:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 05:32:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2021-12-18 05:32:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2021-12-18 05:32:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-18 05:32:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-18 05:32:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2021-12-18 05:32:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2021-12-18 05:32:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-12-18 05:32:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-12-18 05:32:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-12-18 05:32:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-12-18 05:32:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-18 05:32:15,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-18 05:32:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2021-12-18 05:32:15,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2021-12-18 05:32:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 05:32:15,145 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2021-12-18 05:32:15,145 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2021-12-18 05:32:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2021-12-18 05:32:15,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2021-12-18 05:32:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2021-12-18 05:32:15,146 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2021-12-18 05:32:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 05:32:15,146 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2021-12-18 05:32:15,146 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2021-12-18 05:32:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 05:32:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-12-18 05:32:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-12-18 05:32:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-12-18 05:32:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2021-12-18 05:32:15,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2021-12-18 05:32:15,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-12-18 05:32:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2021-12-18 05:32:15,148 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2021-12-18 05:32:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-12-18 05:32:15,148 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-12-18 05:32:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2021-12-18 05:32:15,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2021-12-18 05:32:15,148 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2021-12-18 05:32:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2021-12-18 05:32:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2021-12-18 05:32:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2021-12-18 05:32:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2021-12-18 05:32:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2021-12-18 05:32:15,149 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2021-12-18 05:32:15,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2021-12-18 05:32:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_ULONG~TO~VOID [2021-12-18 05:32:15,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_ULONG~TO~VOID [2021-12-18 05:32:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2021-12-18 05:32:15,150 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2021-12-18 05:32:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-12-18 05:32:15,150 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2021-12-18 05:32:15,150 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2021-12-18 05:32:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2021-12-18 05:32:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2021-12-18 05:32:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 05:32:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 05:32:15,151 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2021-12-18 05:32:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2021-12-18 05:32:15,627 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 05:32:15,629 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 05:32:15,970 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-18 05:32:34,262 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 05:32:34,275 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 05:32:34,276 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 05:32:34,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:32:34 BoogieIcfgContainer [2021-12-18 05:32:34,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 05:32:34,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 05:32:34,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 05:32:34,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 05:32:34,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:32:12" (1/3) ... [2021-12-18 05:32:34,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b69416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:32:34, skipping insertion in model container [2021-12-18 05:32:34,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:32:14" (2/3) ... [2021-12-18 05:32:34,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b69416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:32:34, skipping insertion in model container [2021-12-18 05:32:34,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:32:34" (3/3) ... [2021-12-18 05:32:34,285 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-12-18 05:32:34,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 05:32:34,290 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 05:32:34,334 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 05:32:34,339 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 05:32:34,340 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 05:32:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 816 states have (on average 1.4227941176470589) internal successors, (1161), 848 states have internal predecessors, (1161), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2021-12-18 05:32:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-18 05:32:34,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:34,415 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-18 05:32:34,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:34,422 INFO L85 PathProgramCache]: Analyzing trace with hash 50159505, now seen corresponding path program 1 times [2021-12-18 05:32:34,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:34,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706472761] [2021-12-18 05:32:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:34,438 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:34,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:34,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:34,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 05:32:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:35,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-18 05:32:35,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-12-18 05:32:35,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:35,747 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706472761] [2021-12-18 05:32:35,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706472761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:35,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:35,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 05:32:35,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037487634] [2021-12-18 05:32:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:35,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 05:32:35,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:35,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 05:32:35,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 05:32:35,783 INFO L87 Difference]: Start difference. First operand has 1106 states, 816 states have (on average 1.4227941176470589) internal successors, (1161), 848 states have internal predecessors, (1161), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 05:32:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:35,925 INFO L93 Difference]: Finished difference Result 2208 states and 3277 transitions. [2021-12-18 05:32:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 05:32:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2021-12-18 05:32:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:35,959 INFO L225 Difference]: With dead ends: 2208 [2021-12-18 05:32:35,960 INFO L226 Difference]: Without dead ends: 1064 [2021-12-18 05:32:35,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 05:32:35,977 INFO L933 BasicCegarLoop]: 1625 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:35,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 05:32:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2021-12-18 05:32:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2021-12-18 05:32:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 787 states have (on average 1.4142312579415501) internal successors, (1113), 811 states have internal predecessors, (1113), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2021-12-18 05:32:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1561 transitions. [2021-12-18 05:32:36,094 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1561 transitions. Word has length 161 [2021-12-18 05:32:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:36,094 INFO L470 AbstractCegarLoop]: Abstraction has 1064 states and 1561 transitions. [2021-12-18 05:32:36,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2021-12-18 05:32:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1561 transitions. [2021-12-18 05:32:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-18 05:32:36,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:36,100 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-18 05:32:36,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:36,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:36,320 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1568638009, now seen corresponding path program 1 times [2021-12-18 05:32:36,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:36,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648982417] [2021-12-18 05:32:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:36,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:36,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:36,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:36,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 05:32:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:36,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 05:32:36,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2021-12-18 05:32:37,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:37,411 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648982417] [2021-12-18 05:32:37,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648982417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:37,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:37,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 05:32:37,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951822776] [2021-12-18 05:32:37,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:37,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:32:37,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:37,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:32:37,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:32:37,414 INFO L87 Difference]: Start difference. First operand 1064 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-18 05:32:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:37,582 INFO L93 Difference]: Finished difference Result 2114 states and 3107 transitions. [2021-12-18 05:32:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:32:37,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2021-12-18 05:32:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:37,590 INFO L225 Difference]: With dead ends: 2114 [2021-12-18 05:32:37,591 INFO L226 Difference]: Without dead ends: 1065 [2021-12-18 05:32:37,595 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:32:37,596 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 3 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4662 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:37,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 4662 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 05:32:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-12-18 05:32:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2021-12-18 05:32:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 788 states have (on average 1.4137055837563453) internal successors, (1114), 812 states have internal predecessors, (1114), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2021-12-18 05:32:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1562 transitions. [2021-12-18 05:32:37,641 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1562 transitions. Word has length 161 [2021-12-18 05:32:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:37,643 INFO L470 AbstractCegarLoop]: Abstraction has 1065 states and 1562 transitions. [2021-12-18 05:32:37,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-18 05:32:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1562 transitions. [2021-12-18 05:32:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-18 05:32:37,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:37,649 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-18 05:32:37,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:37,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:37,860 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1190599185, now seen corresponding path program 1 times [2021-12-18 05:32:37,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:37,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316716360] [2021-12-18 05:32:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:37,862 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:37,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 05:32:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:38,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 05:32:38,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2021-12-18 05:32:39,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:32:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-12-18 05:32:39,623 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:39,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316716360] [2021-12-18 05:32:39,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316716360] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:32:39,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 05:32:39,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 05:32:39,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026234986] [2021-12-18 05:32:39,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 05:32:39,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:32:39,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:39,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:32:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:32:39,625 INFO L87 Difference]: Start difference. First operand 1065 states and 1562 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:32:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:40,256 INFO L93 Difference]: Finished difference Result 2125 states and 3126 transitions. [2021-12-18 05:32:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 05:32:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 168 [2021-12-18 05:32:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:40,266 INFO L225 Difference]: With dead ends: 2125 [2021-12-18 05:32:40,266 INFO L226 Difference]: Without dead ends: 1075 [2021-12-18 05:32:40,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2021-12-18 05:32:40,275 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 12 mSDsluCounter, 7749 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9306 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:40,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 9306 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 05:32:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-12-18 05:32:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1075. [2021-12-18 05:32:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 797 states have (on average 1.412797992471769) internal successors, (1126), 821 states have internal predecessors, (1126), 224 states have call successors, (224), 53 states have call predecessors, (224), 53 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2021-12-18 05:32:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1574 transitions. [2021-12-18 05:32:40,317 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1574 transitions. Word has length 168 [2021-12-18 05:32:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:40,318 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 1574 transitions. [2021-12-18 05:32:40,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:32:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1574 transitions. [2021-12-18 05:32:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-12-18 05:32:40,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:40,323 INFO L514 BasicCegarLoop]: trace histogram [24, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-12-18 05:32:40,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:40,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:40,540 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 708259015, now seen corresponding path program 2 times [2021-12-18 05:32:40,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:40,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705350812] [2021-12-18 05:32:40,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 05:32:40,542 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:40,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:40,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:40,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 05:32:40,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 05:32:40,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:32:41,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 05:32:41,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2021-12-18 05:32:41,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:41,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:41,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705350812] [2021-12-18 05:32:41,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705350812] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:41,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:41,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 05:32:41,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215924601] [2021-12-18 05:32:41,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:41,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 05:32:41,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 05:32:41,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:32:41,323 INFO L87 Difference]: Start difference. First operand 1075 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-18 05:32:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:41,582 INFO L93 Difference]: Finished difference Result 2663 states and 3872 transitions. [2021-12-18 05:32:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 05:32:41,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 185 [2021-12-18 05:32:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:41,592 INFO L225 Difference]: With dead ends: 2663 [2021-12-18 05:32:41,592 INFO L226 Difference]: Without dead ends: 1635 [2021-12-18 05:32:41,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:32:41,597 INFO L933 BasicCegarLoop]: 1694 mSDtfsCounter, 828 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:41,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 3172 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 05:32:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2021-12-18 05:32:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1635. [2021-12-18 05:32:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1201 states have (on average 1.3971690258118235) internal successors, (1678), 1234 states have internal predecessors, (1678), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2360 transitions. [2021-12-18 05:32:41,683 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2360 transitions. Word has length 185 [2021-12-18 05:32:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:41,683 INFO L470 AbstractCegarLoop]: Abstraction has 1635 states and 2360 transitions. [2021-12-18 05:32:41,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2021-12-18 05:32:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2360 transitions. [2021-12-18 05:32:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2021-12-18 05:32:41,689 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:41,690 INFO L514 BasicCegarLoop]: trace histogram [24, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:41,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:41,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:41,908 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash -737426143, now seen corresponding path program 1 times [2021-12-18 05:32:41,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:41,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475721755] [2021-12-18 05:32:41,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:41,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:41,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:41,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:41,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 05:32:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:42,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 05:32:42,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 466 proven. 3 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2021-12-18 05:32:43,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:32:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2021-12-18 05:32:44,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:44,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475721755] [2021-12-18 05:32:44,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475721755] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:32:44,337 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 05:32:44,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-18 05:32:44,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699229262] [2021-12-18 05:32:44,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 05:32:44,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 05:32:44,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 05:32:44,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-18 05:32:44,338 INFO L87 Difference]: Start difference. First operand 1635 states and 2360 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-18 05:32:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:45,207 INFO L93 Difference]: Finished difference Result 3248 states and 4694 transitions. [2021-12-18 05:32:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 05:32:45,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 246 [2021-12-18 05:32:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:45,220 INFO L225 Difference]: With dead ends: 3248 [2021-12-18 05:32:45,220 INFO L226 Difference]: Without dead ends: 1639 [2021-12-18 05:32:45,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2021-12-18 05:32:45,228 INFO L933 BasicCegarLoop]: 1553 mSDtfsCounter, 36 mSDsluCounter, 9279 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 10832 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:45,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 10832 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 05:32:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2021-12-18 05:32:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2021-12-18 05:32:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1205 states have (on average 1.3941908713692945) internal successors, (1680), 1238 states have internal predecessors, (1680), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2362 transitions. [2021-12-18 05:32:45,317 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2362 transitions. Word has length 246 [2021-12-18 05:32:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:45,318 INFO L470 AbstractCegarLoop]: Abstraction has 1639 states and 2362 transitions. [2021-12-18 05:32:45,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-18 05:32:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2362 transitions. [2021-12-18 05:32:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-12-18 05:32:45,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:45,324 INFO L514 BasicCegarLoop]: trace histogram [32, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:45,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:45,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:45,538 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1807268831, now seen corresponding path program 2 times [2021-12-18 05:32:45,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:45,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297371833] [2021-12-18 05:32:45,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 05:32:45,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:45,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:45,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:45,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 05:32:45,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 05:32:45,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:32:45,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 05:32:45,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1135 trivial. 0 not checked. [2021-12-18 05:32:46,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:46,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:46,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297371833] [2021-12-18 05:32:46,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297371833] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:46,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:46,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 05:32:46,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603347065] [2021-12-18 05:32:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:46,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:32:46,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:46,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:32:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:32:46,294 INFO L87 Difference]: Start difference. First operand 1639 states and 2362 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-18 05:32:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:46,714 INFO L93 Difference]: Finished difference Result 2229 states and 3307 transitions. [2021-12-18 05:32:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 05:32:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 254 [2021-12-18 05:32:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:46,736 INFO L225 Difference]: With dead ends: 2229 [2021-12-18 05:32:46,737 INFO L226 Difference]: Without dead ends: 2227 [2021-12-18 05:32:46,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:32:46,742 INFO L933 BasicCegarLoop]: 2199 mSDtfsCounter, 795 mSDsluCounter, 3483 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 5682 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:46,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 5682 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 05:32:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2021-12-18 05:32:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1641. [2021-12-18 05:32:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1207 states have (on average 1.3935376967688484) internal successors, (1682), 1240 states have internal predecessors, (1682), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2364 transitions. [2021-12-18 05:32:46,825 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2364 transitions. Word has length 254 [2021-12-18 05:32:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:46,826 INFO L470 AbstractCegarLoop]: Abstraction has 1641 states and 2364 transitions. [2021-12-18 05:32:46,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-18 05:32:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2364 transitions. [2021-12-18 05:32:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2021-12-18 05:32:46,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:46,832 INFO L514 BasicCegarLoop]: trace histogram [32, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:46,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:47,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:47,047 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash -199935539, now seen corresponding path program 1 times [2021-12-18 05:32:47,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:47,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332575642] [2021-12-18 05:32:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:47,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:47,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:47,050 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:47,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 05:32:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:48,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 05:32:48,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 646 proven. 21 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2021-12-18 05:32:48,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:32:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 76 proven. 187 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2021-12-18 05:32:50,393 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:50,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332575642] [2021-12-18 05:32:50,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332575642] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:32:50,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 05:32:50,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-18 05:32:50,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040129585] [2021-12-18 05:32:50,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 05:32:50,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 05:32:50,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:50,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 05:32:50,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-12-18 05:32:50,395 INFO L87 Difference]: Start difference. First operand 1641 states and 2364 transitions. Second operand has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-18 05:32:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:51,983 INFO L93 Difference]: Finished difference Result 3270 states and 4727 transitions. [2021-12-18 05:32:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 05:32:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 255 [2021-12-18 05:32:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:51,995 INFO L225 Difference]: With dead ends: 3270 [2021-12-18 05:32:51,995 INFO L226 Difference]: Without dead ends: 1651 [2021-12-18 05:32:52,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-12-18 05:32:52,003 INFO L933 BasicCegarLoop]: 1557 mSDtfsCounter, 81 mSDsluCounter, 12404 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 13961 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:52,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 13961 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-18 05:32:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-12-18 05:32:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1645. [2021-12-18 05:32:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1211 states have (on average 1.393063583815029) internal successors, (1687), 1244 states have internal predecessors, (1687), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2369 transitions. [2021-12-18 05:32:52,109 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2369 transitions. Word has length 255 [2021-12-18 05:32:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:52,110 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2369 transitions. [2021-12-18 05:32:52,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.333333333333333) internal successors, (114), 18 states have internal predecessors, (114), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2021-12-18 05:32:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2369 transitions. [2021-12-18 05:32:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-12-18 05:32:52,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:52,116 INFO L514 BasicCegarLoop]: trace histogram [36, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:52,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:52,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:52,332 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash 717109837, now seen corresponding path program 2 times [2021-12-18 05:32:52,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783321068] [2021-12-18 05:32:52,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 05:32:52,334 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:52,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:52,334 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:52,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 05:32:52,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 05:32:52,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:32:52,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 05:32:52,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1297 trivial. 0 not checked. [2021-12-18 05:32:53,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:53,089 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:53,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783321068] [2021-12-18 05:32:53,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783321068] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:53,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:53,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 05:32:53,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360657445] [2021-12-18 05:32:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:53,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:32:53,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:53,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:32:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:32:53,091 INFO L87 Difference]: Start difference. First operand 1645 states and 2369 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-18 05:32:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:53,481 INFO L93 Difference]: Finished difference Result 2236 states and 3315 transitions. [2021-12-18 05:32:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 05:32:53,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 259 [2021-12-18 05:32:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:53,497 INFO L225 Difference]: With dead ends: 2236 [2021-12-18 05:32:53,497 INFO L226 Difference]: Without dead ends: 2234 [2021-12-18 05:32:53,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:32:53,500 INFO L933 BasicCegarLoop]: 2207 mSDtfsCounter, 795 mSDsluCounter, 3478 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 5685 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:53,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 5685 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 05:32:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2021-12-18 05:32:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1645. [2021-12-18 05:32:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1211 states have (on average 1.393063583815029) internal successors, (1687), 1244 states have internal predecessors, (1687), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2369 transitions. [2021-12-18 05:32:53,566 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2369 transitions. Word has length 259 [2021-12-18 05:32:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:53,567 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2369 transitions. [2021-12-18 05:32:53,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2021-12-18 05:32:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2369 transitions. [2021-12-18 05:32:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-12-18 05:32:53,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:53,575 INFO L514 BasicCegarLoop]: trace histogram [36, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:53,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-18 05:32:53,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:53,789 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:53,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1432979626, now seen corresponding path program 1 times [2021-12-18 05:32:53,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:53,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335921748] [2021-12-18 05:32:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:53,790 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:53,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:53,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:53,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 05:32:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:55,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 1386 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 05:32:55,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2021-12-18 05:32:56,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:56,365 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:56,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335921748] [2021-12-18 05:32:56,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335921748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:56,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:56,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 05:32:56,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043837150] [2021-12-18 05:32:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:56,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 05:32:56,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 05:32:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:32:56,367 INFO L87 Difference]: Start difference. First operand 1645 states and 2369 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:32:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:56,452 INFO L93 Difference]: Finished difference Result 3225 states and 4658 transitions. [2021-12-18 05:32:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 05:32:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 268 [2021-12-18 05:32:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:56,462 INFO L225 Difference]: With dead ends: 3225 [2021-12-18 05:32:56,463 INFO L226 Difference]: Without dead ends: 1645 [2021-12-18 05:32:56,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:32:56,470 INFO L933 BasicCegarLoop]: 1552 mSDtfsCounter, 1486 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:56,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1486 Valid, 1552 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 05:32:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2021-12-18 05:32:56,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2021-12-18 05:32:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1211 states have (on average 1.3914120561519405) internal successors, (1685), 1244 states have internal predecessors, (1685), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2367 transitions. [2021-12-18 05:32:56,527 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2367 transitions. Word has length 268 [2021-12-18 05:32:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:56,527 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2367 transitions. [2021-12-18 05:32:56,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:32:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2367 transitions. [2021-12-18 05:32:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2021-12-18 05:32:56,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:56,534 INFO L514 BasicCegarLoop]: trace histogram [36, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:56,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:56,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:56,755 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1719485204, now seen corresponding path program 1 times [2021-12-18 05:32:56,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028708016] [2021-12-18 05:32:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:56,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:56,758 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:56,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 05:32:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:32:58,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 1385 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 05:32:58,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:32:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2021-12-18 05:32:58,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:32:58,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:32:58,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028708016] [2021-12-18 05:32:58,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028708016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:32:58,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:32:58,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 05:32:58,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052723821] [2021-12-18 05:32:58,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:32:58,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:32:58,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:32:58,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:32:58,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:32:58,808 INFO L87 Difference]: Start difference. First operand 1645 states and 2367 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:32:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:32:58,931 INFO L93 Difference]: Finished difference Result 3229 states and 4658 transitions. [2021-12-18 05:32:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:32:58,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 268 [2021-12-18 05:32:58,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:32:58,941 INFO L225 Difference]: With dead ends: 3229 [2021-12-18 05:32:58,942 INFO L226 Difference]: Without dead ends: 1645 [2021-12-18 05:32:58,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:32:58,950 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1 mSDsluCounter, 3111 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4670 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 05:32:58,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4670 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 05:32:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2021-12-18 05:32:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1645. [2021-12-18 05:32:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1211 states have (on average 1.3897605284888521) internal successors, (1683), 1244 states have internal predecessors, (1683), 341 states have call successors, (341), 92 states have call predecessors, (341), 92 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2021-12-18 05:32:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2365 transitions. [2021-12-18 05:32:59,036 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2365 transitions. Word has length 268 [2021-12-18 05:32:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:32:59,037 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2365 transitions. [2021-12-18 05:32:59,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:32:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2365 transitions. [2021-12-18 05:32:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-18 05:32:59,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:32:59,045 INFO L514 BasicCegarLoop]: trace histogram [36, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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] [2021-12-18 05:32:59,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 05:32:59,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:32:59,259 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:32:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:32:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 213641379, now seen corresponding path program 1 times [2021-12-18 05:32:59,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:32:59,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534334800] [2021-12-18 05:32:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:32:59,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:32:59,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:32:59,262 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:32:59,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 05:33:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:00,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 05:33:00,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2021-12-18 05:33:01,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:33:01,581 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:01,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534334800] [2021-12-18 05:33:01,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534334800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:33:01,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:33:01,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 05:33:01,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512307282] [2021-12-18 05:33:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:33:01,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 05:33:01,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:01,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 05:33:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 05:33:01,583 INFO L87 Difference]: Start difference. First operand 1645 states and 2365 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:33:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:02,426 INFO L93 Difference]: Finished difference Result 3793 states and 5456 transitions. [2021-12-18 05:33:02,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 05:33:02,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) Word has length 271 [2021-12-18 05:33:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:02,455 INFO L225 Difference]: With dead ends: 3793 [2021-12-18 05:33:02,456 INFO L226 Difference]: Without dead ends: 2205 [2021-12-18 05:33:02,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-18 05:33:02,463 INFO L933 BasicCegarLoop]: 1692 mSDtfsCounter, 829 mSDsluCounter, 11645 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 13337 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:02,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [833 Valid, 13337 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 05:33:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2021-12-18 05:33:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2203. [2021-12-18 05:33:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 1612 states have (on average 1.382133995037221) internal successors, (2228), 1657 states have internal predecessors, (2228), 455 states have call successors, (455), 129 states have call predecessors, (455), 135 states have return successors, (475), 453 states have call predecessors, (475), 455 states have call successors, (475) [2021-12-18 05:33:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3158 transitions. [2021-12-18 05:33:02,552 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3158 transitions. Word has length 271 [2021-12-18 05:33:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:02,552 INFO L470 AbstractCegarLoop]: Abstraction has 2203 states and 3158 transitions. [2021-12-18 05:33:02,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 7 states have internal predecessors, (97), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:33:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3158 transitions. [2021-12-18 05:33:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-12-18 05:33:02,563 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:02,564 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 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] [2021-12-18 05:33:02,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:02,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:02,783 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -408184909, now seen corresponding path program 1 times [2021-12-18 05:33:02,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:02,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231782340] [2021-12-18 05:33:02,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:02,785 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:02,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:02,786 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:02,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 05:33:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:04,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 1410 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 05:33:04,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2021-12-18 05:33:05,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:33:05,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231782340] [2021-12-18 05:33:05,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231782340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:33:05,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:33:05,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 05:33:05,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548985368] [2021-12-18 05:33:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:33:05,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:33:05,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:33:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:33:05,746 INFO L87 Difference]: Start difference. First operand 2203 states and 3158 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-18 05:33:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:08,307 INFO L93 Difference]: Finished difference Result 4385 states and 6411 transitions. [2021-12-18 05:33:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:33:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 277 [2021-12-18 05:33:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:08,323 INFO L225 Difference]: With dead ends: 4385 [2021-12-18 05:33:08,324 INFO L226 Difference]: Without dead ends: 2793 [2021-12-18 05:33:08,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:33:08,330 INFO L933 BasicCegarLoop]: 1878 mSDtfsCounter, 1914 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2015 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:08,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2015 Valid, 2977 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-18 05:33:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2021-12-18 05:33:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2204. [2021-12-18 05:33:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 1613 states have (on average 1.3818970861748294) internal successors, (2229), 1658 states have internal predecessors, (2229), 455 states have call successors, (455), 129 states have call predecessors, (455), 135 states have return successors, (475), 453 states have call predecessors, (475), 455 states have call successors, (475) [2021-12-18 05:33:08,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 3159 transitions. [2021-12-18 05:33:08,427 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 3159 transitions. Word has length 277 [2021-12-18 05:33:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:08,428 INFO L470 AbstractCegarLoop]: Abstraction has 2204 states and 3159 transitions. [2021-12-18 05:33:08,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-18 05:33:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 3159 transitions. [2021-12-18 05:33:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-12-18 05:33:08,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:08,438 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 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] [2021-12-18 05:33:08,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:08,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:08,651 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:08,652 INFO L85 PathProgramCache]: Analyzing trace with hash 779401460, now seen corresponding path program 1 times [2021-12-18 05:33:08,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080897169] [2021-12-18 05:33:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:08,653 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:08,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:08,654 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:08,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 05:33:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:10,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 05:33:10,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2021-12-18 05:33:10,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:33:10,779 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:10,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080897169] [2021-12-18 05:33:10,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080897169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:33:10,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:33:10,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 05:33:10,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088816132] [2021-12-18 05:33:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:33:10,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 05:33:10,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:10,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 05:33:10,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:33:10,782 INFO L87 Difference]: Start difference. First operand 2204 states and 3159 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-18 05:33:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:11,355 INFO L93 Difference]: Finished difference Result 2800 states and 4113 transitions. [2021-12-18 05:33:11,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 05:33:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 279 [2021-12-18 05:33:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:11,372 INFO L225 Difference]: With dead ends: 2800 [2021-12-18 05:33:11,372 INFO L226 Difference]: Without dead ends: 2798 [2021-12-18 05:33:11,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:33:11,375 INFO L933 BasicCegarLoop]: 2159 mSDtfsCounter, 1113 mSDsluCounter, 5260 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 7419 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:11,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 7419 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 05:33:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2021-12-18 05:33:11,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2206. [2021-12-18 05:33:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 1614 states have (on average 1.3816604708798017) internal successors, (2230), 1659 states have internal predecessors, (2230), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:33:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3162 transitions. [2021-12-18 05:33:11,489 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3162 transitions. Word has length 279 [2021-12-18 05:33:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:11,490 INFO L470 AbstractCegarLoop]: Abstraction has 2206 states and 3162 transitions. [2021-12-18 05:33:11,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-18 05:33:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3162 transitions. [2021-12-18 05:33:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2021-12-18 05:33:11,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:11,499 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 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] [2021-12-18 05:33:11,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:11,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:11,719 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -947682420, now seen corresponding path program 1 times [2021-12-18 05:33:11,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:11,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897152490] [2021-12-18 05:33:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:11,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:11,722 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:11,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 05:33:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1452 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 05:33:13,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 165 proven. 6 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2021-12-18 05:33:14,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:33:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2021-12-18 05:33:16,389 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:16,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897152490] [2021-12-18 05:33:16,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897152490] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:33:16,389 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 05:33:16,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2021-12-18 05:33:16,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99017441] [2021-12-18 05:33:16,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 05:33:16,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 05:33:16,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 05:33:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-18 05:33:16,391 INFO L87 Difference]: Start difference. First operand 2206 states and 3162 transitions. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 10 states have internal predecessors, (114), 3 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (29), 6 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-18 05:33:24,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:33:26,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:33:28,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 05:33:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:29,933 INFO L93 Difference]: Finished difference Result 3807 states and 5479 transitions. [2021-12-18 05:33:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 05:33:29,939 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 10 states have internal predecessors, (114), 3 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (29), 6 states have call predecessors, (29), 3 states have call successors, (29) Word has length 287 [2021-12-18 05:33:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:29,967 INFO L225 Difference]: With dead ends: 3807 [2021-12-18 05:33:29,968 INFO L226 Difference]: Without dead ends: 2212 [2021-12-18 05:33:29,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 564 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2021-12-18 05:33:29,975 INFO L933 BasicCegarLoop]: 2210 mSDtfsCounter, 1832 mSDsluCounter, 20198 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1833 SdHoareTripleChecker+Valid, 22408 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:29,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1833 Valid, 22408 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2021-12-18 05:33:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2021-12-18 05:33:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2206. [2021-12-18 05:33:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 1614 states have (on average 1.3810408921933086) internal successors, (2229), 1659 states have internal predecessors, (2229), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:33:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3161 transitions. [2021-12-18 05:33:30,089 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3161 transitions. Word has length 287 [2021-12-18 05:33:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:30,089 INFO L470 AbstractCegarLoop]: Abstraction has 2206 states and 3161 transitions. [2021-12-18 05:33:30,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 10 states have internal predecessors, (114), 3 states have call successors, (29), 3 states have call predecessors, (29), 6 states have return successors, (29), 6 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-18 05:33:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3161 transitions. [2021-12-18 05:33:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-12-18 05:33:30,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:30,100 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 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] [2021-12-18 05:33:30,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:30,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:30,315 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 505583590, now seen corresponding path program 1 times [2021-12-18 05:33:30,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953802215] [2021-12-18 05:33:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:30,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:30,318 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:30,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 05:33:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:32,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 05:33:32,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2021-12-18 05:33:33,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:33:33,717 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:33,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953802215] [2021-12-18 05:33:33,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953802215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:33:33,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:33:33,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 05:33:33,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953366328] [2021-12-18 05:33:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:33:33,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:33:33,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:33,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:33:33,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:33:33,719 INFO L87 Difference]: Start difference. First operand 2206 states and 3161 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:33:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:37,034 INFO L93 Difference]: Finished difference Result 4393 states and 6419 transitions. [2021-12-18 05:33:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:33:37,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 289 [2021-12-18 05:33:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:37,049 INFO L225 Difference]: With dead ends: 4393 [2021-12-18 05:33:37,049 INFO L226 Difference]: Without dead ends: 2798 [2021-12-18 05:33:37,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:33:37,056 INFO L933 BasicCegarLoop]: 2087 mSDtfsCounter, 1898 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:37,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1999 Valid, 3181 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-18 05:33:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2021-12-18 05:33:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2210. [2021-12-18 05:33:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 1618 states have (on average 1.380716934487021) internal successors, (2234), 1663 states have internal predecessors, (2234), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:33:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3166 transitions. [2021-12-18 05:33:37,160 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3166 transitions. Word has length 289 [2021-12-18 05:33:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:37,161 INFO L470 AbstractCegarLoop]: Abstraction has 2210 states and 3166 transitions. [2021-12-18 05:33:37,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-18 05:33:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3166 transitions. [2021-12-18 05:33:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2021-12-18 05:33:37,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:37,171 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 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] [2021-12-18 05:33:37,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:37,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:37,395 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1739790192, now seen corresponding path program 1 times [2021-12-18 05:33:37,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:37,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525121094] [2021-12-18 05:33:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:37,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:37,399 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:37,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 05:33:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:39,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 1460 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 05:33:39,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2021-12-18 05:33:40,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 05:33:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2021-12-18 05:33:41,350 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:41,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525121094] [2021-12-18 05:33:41,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525121094] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 05:33:41,350 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 05:33:41,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-18 05:33:41,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361920676] [2021-12-18 05:33:41,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 05:33:41,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 05:33:41,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 05:33:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:33:41,353 INFO L87 Difference]: Start difference. First operand 2210 states and 3166 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 4 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2021-12-18 05:33:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:52,681 INFO L93 Difference]: Finished difference Result 6150 states and 9231 transitions. [2021-12-18 05:33:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 05:33:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 4 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 292 [2021-12-18 05:33:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:52,701 INFO L225 Difference]: With dead ends: 6150 [2021-12-18 05:33:52,701 INFO L226 Difference]: Without dead ends: 4551 [2021-12-18 05:33:52,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-18 05:33:52,708 INFO L933 BasicCegarLoop]: 2898 mSDtfsCounter, 5468 mSDsluCounter, 5036 mSDsCounter, 0 mSdLazyCounter, 3155 mSolverCounterSat, 1270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5670 SdHoareTripleChecker+Valid, 7934 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1270 IncrementalHoareTripleChecker+Valid, 3155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:52,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5670 Valid, 7934 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1270 Valid, 3155 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2021-12-18 05:33:52,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2021-12-18 05:33:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 2217. [2021-12-18 05:33:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1625 states have (on average 1.3803076923076922) internal successors, (2243), 1670 states have internal predecessors, (2243), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:33:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3175 transitions. [2021-12-18 05:33:52,868 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3175 transitions. Word has length 292 [2021-12-18 05:33:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:52,869 INFO L470 AbstractCegarLoop]: Abstraction has 2217 states and 3175 transitions. [2021-12-18 05:33:52,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 4 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2021-12-18 05:33:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3175 transitions. [2021-12-18 05:33:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2021-12-18 05:33:52,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:52,880 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:33:52,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:53,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:53,100 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1026160200, now seen corresponding path program 1 times [2021-12-18 05:33:53,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:53,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028735552] [2021-12-18 05:33:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:53,101 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:53,102 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:53,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 05:33:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:55,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 05:33:55,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2021-12-18 05:33:55,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:33:55,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:55,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028735552] [2021-12-18 05:33:55,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028735552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:33:55,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:33:55,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 05:33:55,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199708020] [2021-12-18 05:33:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:33:55,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 05:33:55,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 05:33:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:33:55,495 INFO L87 Difference]: Start difference. First operand 2217 states and 3175 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-18 05:33:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:33:56,144 INFO L93 Difference]: Finished difference Result 3297 states and 4896 transitions. [2021-12-18 05:33:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 05:33:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 301 [2021-12-18 05:33:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:33:56,162 INFO L225 Difference]: With dead ends: 3297 [2021-12-18 05:33:56,162 INFO L226 Difference]: Without dead ends: 3295 [2021-12-18 05:33:56,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:33:56,166 INFO L933 BasicCegarLoop]: 2311 mSDtfsCounter, 1541 mSDsluCounter, 5844 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 8155 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 05:33:56,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 8155 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 05:33:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2021-12-18 05:33:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 2217. [2021-12-18 05:33:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1625 states have (on average 1.3803076923076922) internal successors, (2243), 1669 states have internal predecessors, (2243), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:33:56,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3175 transitions. [2021-12-18 05:33:56,298 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3175 transitions. Word has length 301 [2021-12-18 05:33:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:33:56,299 INFO L470 AbstractCegarLoop]: Abstraction has 2217 states and 3175 transitions. [2021-12-18 05:33:56,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2021-12-18 05:33:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3175 transitions. [2021-12-18 05:33:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2021-12-18 05:33:56,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:33:56,311 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 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] [2021-12-18 05:33:56,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 05:33:56,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:33:56,536 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:33:56,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:33:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1349835205, now seen corresponding path program 1 times [2021-12-18 05:33:56,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:33:56,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918369395] [2021-12-18 05:33:56,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:33:56,537 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:33:56,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:33:56,538 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:33:56,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 05:33:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:33:58,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 05:33:58,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:33:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2021-12-18 05:33:59,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:33:59,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:33:59,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918369395] [2021-12-18 05:33:59,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918369395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:33:59,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:33:59,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 05:33:59,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989477944] [2021-12-18 05:33:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:33:59,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 05:33:59,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:33:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 05:33:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 05:33:59,124 INFO L87 Difference]: Start difference. First operand 2217 states and 3175 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-12-18 05:34:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:34:00,062 INFO L93 Difference]: Finished difference Result 4753 states and 6983 transitions. [2021-12-18 05:34:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 05:34:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 323 [2021-12-18 05:34:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:34:00,073 INFO L225 Difference]: With dead ends: 4753 [2021-12-18 05:34:00,074 INFO L226 Difference]: Without dead ends: 3147 [2021-12-18 05:34:00,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 05:34:00,080 INFO L933 BasicCegarLoop]: 2296 mSDtfsCounter, 844 mSDsluCounter, 3718 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 6014 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 05:34:00,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [917 Valid, 6014 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 05:34:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2021-12-18 05:34:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2219. [2021-12-18 05:34:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1627 states have (on average 1.3798401966810079) internal successors, (2245), 1671 states have internal predecessors, (2245), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:34:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 3177 transitions. [2021-12-18 05:34:00,204 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 3177 transitions. Word has length 323 [2021-12-18 05:34:00,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:34:00,205 INFO L470 AbstractCegarLoop]: Abstraction has 2219 states and 3177 transitions. [2021-12-18 05:34:00,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2021-12-18 05:34:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 3177 transitions. [2021-12-18 05:34:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2021-12-18 05:34:00,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:34:00,215 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:34:00,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 05:34:00,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:34:00,432 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:34:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:34:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1134216281, now seen corresponding path program 1 times [2021-12-18 05:34:00,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:34:00,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378339429] [2021-12-18 05:34:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:34:00,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:34:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:34:00,434 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:34:00,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 05:34:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:34:02,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 05:34:02,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:34:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1328 trivial. 0 not checked. [2021-12-18 05:34:03,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:34:03,113 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:34:03,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378339429] [2021-12-18 05:34:03,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378339429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:34:03,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:34:03,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 05:34:03,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035489701] [2021-12-18 05:34:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:34:03,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 05:34:03,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:34:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 05:34:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:34:03,115 INFO L87 Difference]: Start difference. First operand 2219 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 05:34:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:34:03,529 INFO L93 Difference]: Finished difference Result 4305 states and 6265 transitions. [2021-12-18 05:34:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 05:34:03,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 332 [2021-12-18 05:34:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:34:03,555 INFO L225 Difference]: With dead ends: 4305 [2021-12-18 05:34:03,556 INFO L226 Difference]: Without dead ends: 2697 [2021-12-18 05:34:03,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:34:03,562 INFO L933 BasicCegarLoop]: 2051 mSDtfsCounter, 352 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 3664 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 05:34:03,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 3664 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 05:34:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2021-12-18 05:34:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2221. [2021-12-18 05:34:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1629 states have (on average 1.3793738489871086) internal successors, (2247), 1673 states have internal predecessors, (2247), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:34:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3179 transitions. [2021-12-18 05:34:03,682 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3179 transitions. Word has length 332 [2021-12-18 05:34:03,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:34:03,683 INFO L470 AbstractCegarLoop]: Abstraction has 2221 states and 3179 transitions. [2021-12-18 05:34:03,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2021-12-18 05:34:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3179 transitions. [2021-12-18 05:34:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2021-12-18 05:34:03,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:34:03,692 INFO L514 BasicCegarLoop]: trace histogram [36, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:34:03,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 05:34:03,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:34:03,912 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:34:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:34:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1733310473, now seen corresponding path program 1 times [2021-12-18 05:34:03,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:34:03,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391629681] [2021-12-18 05:34:03,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:34:03,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:34:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:34:03,915 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:34:03,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 05:34:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:34:06,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 1818 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 05:34:06,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:34:07,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1343 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2021-12-18 05:34:07,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:34:07,084 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:34:07,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391629681] [2021-12-18 05:34:07,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391629681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:34:07,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:34:07,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 05:34:07,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739634834] [2021-12-18 05:34:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:34:07,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 05:34:07,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:34:07,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 05:34:07,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 05:34:07,085 INFO L87 Difference]: Start difference. First operand 2221 states and 3179 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-18 05:34:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:34:08,574 INFO L93 Difference]: Finished difference Result 4921 states and 7238 transitions. [2021-12-18 05:34:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 05:34:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 340 [2021-12-18 05:34:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:34:08,592 INFO L225 Difference]: With dead ends: 4921 [2021-12-18 05:34:08,593 INFO L226 Difference]: Without dead ends: 3311 [2021-12-18 05:34:08,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 05:34:08,602 INFO L933 BasicCegarLoop]: 2305 mSDtfsCounter, 1175 mSDsluCounter, 8465 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 10770 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-18 05:34:08,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1278 Valid, 10770 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-18 05:34:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2021-12-18 05:34:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 2224. [2021-12-18 05:34:08,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 1632 states have (on average 1.3786764705882353) internal successors, (2250), 1675 states have internal predecessors, (2250), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:34:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3182 transitions. [2021-12-18 05:34:08,778 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3182 transitions. Word has length 340 [2021-12-18 05:34:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:34:08,779 INFO L470 AbstractCegarLoop]: Abstraction has 2224 states and 3182 transitions. [2021-12-18 05:34:08,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-18 05:34:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3182 transitions. [2021-12-18 05:34:08,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2021-12-18 05:34:08,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:34:08,789 INFO L514 BasicCegarLoop]: trace histogram [36, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:34:08,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 05:34:09,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:34:09,008 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:34:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:34:09,008 INFO L85 PathProgramCache]: Analyzing trace with hash -432990855, now seen corresponding path program 2 times [2021-12-18 05:34:09,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:34:09,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731825078] [2021-12-18 05:34:09,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 05:34:09,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:34:09,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:34:09,011 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:34:09,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 05:34:09,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 05:34:09,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 05:34:09,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 05:34:09,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:34:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1377 trivial. 0 not checked. [2021-12-18 05:34:10,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 05:34:10,239 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 05:34:10,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731825078] [2021-12-18 05:34:10,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731825078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 05:34:10,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 05:34:10,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 05:34:10,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801954495] [2021-12-18 05:34:10,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 05:34:10,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 05:34:10,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 05:34:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 05:34:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:34:10,240 INFO L87 Difference]: Start difference. First operand 2224 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-18 05:34:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 05:34:10,351 INFO L93 Difference]: Finished difference Result 4386 states and 6317 transitions. [2021-12-18 05:34:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 05:34:10,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 346 [2021-12-18 05:34:10,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 05:34:10,361 INFO L225 Difference]: With dead ends: 4386 [2021-12-18 05:34:10,361 INFO L226 Difference]: Without dead ends: 2227 [2021-12-18 05:34:10,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 05:34:10,370 INFO L933 BasicCegarLoop]: 1553 mSDtfsCounter, 0 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 05:34:10,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3099 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 05:34:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2021-12-18 05:34:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2224. [2021-12-18 05:34:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 1632 states have (on average 1.3731617647058822) internal successors, (2241), 1675 states have internal predecessors, (2241), 456 states have call successors, (456), 129 states have call predecessors, (456), 135 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2021-12-18 05:34:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3173 transitions. [2021-12-18 05:34:10,528 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3173 transitions. Word has length 346 [2021-12-18 05:34:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 05:34:10,528 INFO L470 AbstractCegarLoop]: Abstraction has 2224 states and 3173 transitions. [2021-12-18 05:34:10,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-18 05:34:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3173 transitions. [2021-12-18 05:34:10,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2021-12-18 05:34:10,541 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 05:34:10,543 INFO L514 BasicCegarLoop]: trace histogram [36, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 05:34:10,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-18 05:34:10,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 05:34:10,765 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 05:34:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 05:34:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1979708112, now seen corresponding path program 1 times [2021-12-18 05:34:10,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 05:34:10,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7488602] [2021-12-18 05:34:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 05:34:10,767 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 05:34:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 05:34:10,769 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 05:34:10,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 05:34:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 05:34:23,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1841 conjuncts, 151 conjunts are in the unsatisfiable core [2021-12-18 05:34:23,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 05:34:23,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 05:34:24,162 INFO L388 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 8 treesize of output 6 [2021-12-18 05:34:24,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-12-18 05:34:24,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-12-18 05:34:25,652 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 05:34:25,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-18 05:34:26,068 INFO L388 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-18 05:34:26,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-12-18 05:34:26,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-12-18 05:34:27,646 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-18 05:34:27,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-18 05:34:31,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:31,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:31,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 05:34:31,712 INFO L354 Elim1Store]: treesize reduction 60, result has 35.5 percent of original size [2021-12-18 05:34:31,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 59 [2021-12-18 05:34:33,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:33,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:33,054 INFO L244 Elim1Store]: Index analysis took 101 ms [2021-12-18 05:34:33,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-12-18 05:34:33,683 INFO L388 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 [2021-12-18 05:34:34,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:34,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:34,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:34,807 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-18 05:34:34,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2021-12-18 05:34:36,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:36,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:37,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:37,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:37,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:37,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 05:34:37,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 05:34:37,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 05:34:37,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 30 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 81 [2021-12-18 05:34:50,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 05:34:50,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-18 05:34:50,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:50,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 38 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 100 [2021-12-18 05:34:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-18 05:34:52,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 05:34:52,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:52,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2021-12-18 05:34:57,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,358 INFO L244 Elim1Store]: Index analysis took 236 ms [2021-12-18 05:34:57,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 80 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 138 [2021-12-18 05:34:57,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,549 INFO L244 Elim1Store]: Index analysis took 106 ms [2021-12-18 05:34:57,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 94 [2021-12-18 05:34:57,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:34:57,694 INFO L244 Elim1Store]: Index analysis took 114 ms [2021-12-18 05:34:57,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 96 [2021-12-18 05:35:03,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 80 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 118 [2021-12-18 05:35:03,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 80 [2021-12-18 05:35:03,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 47 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 80 [2021-12-18 05:35:03,555 INFO L388 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 14 treesize of output 16 [2021-12-18 05:35:03,581 INFO L388 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 21 treesize of output 21 [2021-12-18 05:35:03,649 INFO L388 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 43 treesize of output 39 [2021-12-18 05:35:08,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,131 INFO L388 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2021-12-18 05:35:08,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 05:35:08,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2021-12-18 05:35:08,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-18 05:35:08,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:08,230 INFO L388 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 24 treesize of output 26 [2021-12-18 05:35:08,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 05:35:25,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:25,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:26,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,325 INFO L244 Elim1Store]: Index analysis took 2342 ms [2021-12-18 05:35:27,535 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-18 05:35:27,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 101 treesize of output 133 [2021-12-18 05:35:27,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,714 INFO L244 Elim1Store]: Index analysis took 113 ms [2021-12-18 05:35:27,726 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-18 05:35:27,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 17 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 77 [2021-12-18 05:35:27,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:35:27,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 05:35:27,821 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-18 05:35:27,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 87 [2021-12-18 05:36:08,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:08,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 16 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2021-12-18 05:36:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 85 [2021-12-18 05:36:09,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 05:36:09,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 16 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 Killed by 15