./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 00:37:12,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:37:12,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:37:12,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:37:12,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:37:12,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:37:12,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:37:12,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:37:12,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:37:12,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:37:12,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:37:12,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:37:12,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:37:12,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:37:12,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:37:12,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:37:12,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:37:12,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:37:12,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:37:12,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:37:12,613 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:37:12,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:37:12,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:37:12,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:37:12,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:37:12,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:37:12,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:37:12,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:37:12,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:37:12,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:37:12,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:37:12,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:37:12,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:37:12,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:37:12,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:37:12,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:37:12,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:37:12,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:37:12,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:37:12,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:37:12,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:37:12,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:37:12,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:37:12,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:37:12,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:37:12,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:37:12,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:37:12,655 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:37:12,655 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:37:12,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:37:12,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:37:12,656 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:37:12,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:37:12,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:37:12,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:37:12,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:37:12,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:37:12,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:37:12,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:37:12,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:37:12,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:37:12,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:37:12,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:37:12,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:37:12,659 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:37:12,659 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:37:12,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:37:12,660 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 -> 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 [2022-07-20 00:37:12,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:37:12,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:37:12,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:37:12,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:37:12,856 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:37:12,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-20 00:37:12,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86ee6013/47a64fc8cfcf4073a92fcdbd4cb2ca19/FLAGdbad8fd09 [2022-07-20 00:37:13,452 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:37:13,453 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-20 00:37:13,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86ee6013/47a64fc8cfcf4073a92fcdbd4cb2ca19/FLAGdbad8fd09 [2022-07-20 00:37:13,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86ee6013/47a64fc8cfcf4073a92fcdbd4cb2ca19 [2022-07-20 00:37:13,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:37:13,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:37:13,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:37:13,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:37:13,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:37:13,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:37:13" (1/1) ... [2022-07-20 00:37:13,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbcde64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:13, skipping insertion in model container [2022-07-20 00:37:13,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:37:13" (1/1) ... [2022-07-20 00:37:13,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:37:14,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:37:14,805 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2022-07-20 00:37:14,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:37:14,880 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:37:15,097 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-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2022-07-20 00:37:15,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:37:15,230 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:37:15,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15 WrapperNode [2022-07-20 00:37:15,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:37:15,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:37:15,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:37:15,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:37:15,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,401 INFO L137 Inliner]: procedures = 199, calls = 2183, calls flagged for inlining = 73, calls inlined = 51, statements flattened = 3134 [2022-07-20 00:37:15,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:37:15,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:37:15,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:37:15,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:37:15,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:37:15,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:37:15,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:37:15,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:37:15,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (1/1) ... [2022-07-20 00:37:15,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:37:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:37:15,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 00:37:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-20 00:37:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-20 00:37:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:37:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-20 00:37:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:37:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-07-20 00:37:15,601 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-20 00:37:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-20 00:37:15,602 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-20 00:37:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:37:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-20 00:37:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-20 00:37:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:37:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:37:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-20 00:37:15,606 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-20 00:37:15,960 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:37:15,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:37:24,016 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:37:24,712 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:37:24,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:37:24,721 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:37:24,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:37:24 BoogieIcfgContainer [2022-07-20 00:37:24,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:37:24,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:37:24,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:37:24,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:37:24,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:37:13" (1/3) ... [2022-07-20 00:37:24,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff51acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:37:24, skipping insertion in model container [2022-07-20 00:37:24,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:37:15" (2/3) ... [2022-07-20 00:37:24,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff51acd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:37:24, skipping insertion in model container [2022-07-20 00:37:24,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:37:24" (3/3) ... [2022-07-20 00:37:24,728 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-20 00:37:24,737 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:37:24,737 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:37:24,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:37:24,781 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@442a7b51, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@553a96be [2022-07-20 00:37:24,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:37:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 751 states, 578 states have (on average 1.4792387543252594) internal successors, (855), 592 states have internal predecessors, (855), 140 states have call successors, (140), 32 states have call predecessors, (140), 31 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2022-07-20 00:37:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 00:37:24,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:24,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:24,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash 392482652, now seen corresponding path program 1 times [2022-07-20 00:37:24,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:24,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065423397] [2022-07-20 00:37:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 00:37:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:25,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065423397] [2022-07-20 00:37:25,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065423397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:25,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:25,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:37:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027170114] [2022-07-20 00:37:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:25,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:37:25,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:25,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:37:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:37:25,286 INFO L87 Difference]: Start difference. First operand has 751 states, 578 states have (on average 1.4792387543252594) internal successors, (855), 592 states have internal predecessors, (855), 140 states have call successors, (140), 32 states have call predecessors, (140), 31 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:25,527 INFO L93 Difference]: Finished difference Result 2181 states and 3329 transitions. [2022-07-20 00:37:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:37:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-20 00:37:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:25,543 INFO L225 Difference]: With dead ends: 2181 [2022-07-20 00:37:25,543 INFO L226 Difference]: Without dead ends: 1419 [2022-07-20 00:37:25,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:37:25,551 INFO L413 NwaCegarLoop]: 1253 mSDtfsCounter, 1087 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:25,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 2303 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 00:37:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-07-20 00:37:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1415. [2022-07-20 00:37:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1096 states have (on average 1.4753649635036497) internal successors, (1617), 1108 states have internal predecessors, (1617), 258 states have call successors, (258), 61 states have call predecessors, (258), 60 states have return successors, (253), 253 states have call predecessors, (253), 253 states have call successors, (253) [2022-07-20 00:37:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2128 transitions. [2022-07-20 00:37:25,639 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2128 transitions. Word has length 21 [2022-07-20 00:37:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:25,641 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 2128 transitions. [2022-07-20 00:37:25,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2128 transitions. [2022-07-20 00:37:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 00:37:25,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:25,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:25,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:37:25,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1015935201, now seen corresponding path program 1 times [2022-07-20 00:37:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:25,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083826713] [2022-07-20 00:37:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:37:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 00:37:25,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:25,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083826713] [2022-07-20 00:37:25,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083826713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:25,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:25,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 00:37:25,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551145786] [2022-07-20 00:37:25,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:25,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 00:37:25,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:25,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 00:37:25,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:37:25,760 INFO L87 Difference]: Start difference. First operand 1415 states and 2128 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:25,921 INFO L93 Difference]: Finished difference Result 3978 states and 5978 transitions. [2022-07-20 00:37:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 00:37:25,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-20 00:37:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:25,937 INFO L225 Difference]: With dead ends: 3978 [2022-07-20 00:37:25,938 INFO L226 Difference]: Without dead ends: 2566 [2022-07-20 00:37:25,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 00:37:25,947 INFO L413 NwaCegarLoop]: 1244 mSDtfsCounter, 904 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:25,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2288 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 00:37:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-20 00:37:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2549. [2022-07-20 00:37:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1962 states have (on average 1.4658511722731906) internal successors, (2876), 1982 states have internal predecessors, (2876), 481 states have call successors, (481), 106 states have call predecessors, (481), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-20 00:37:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3833 transitions. [2022-07-20 00:37:26,016 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3833 transitions. Word has length 24 [2022-07-20 00:37:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:26,016 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 3833 transitions. [2022-07-20 00:37:26,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3833 transitions. [2022-07-20 00:37:26,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 00:37:26,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:26,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:26,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:37:26,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2094049435, now seen corresponding path program 1 times [2022-07-20 00:37:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:26,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846503157] [2022-07-20 00:37:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:26,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 00:37:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:26,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846503157] [2022-07-20 00:37:26,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846503157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:26,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:26,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:37:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427964990] [2022-07-20 00:37:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:26,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:37:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:37:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:37:26,187 INFO L87 Difference]: Start difference. First operand 2549 states and 3833 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:27,389 INFO L93 Difference]: Finished difference Result 2559 states and 3854 transitions. [2022-07-20 00:37:27,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:37:27,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-20 00:37:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:27,401 INFO L225 Difference]: With dead ends: 2559 [2022-07-20 00:37:27,401 INFO L226 Difference]: Without dead ends: 2556 [2022-07-20 00:37:27,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:37:27,403 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 1064 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:27,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1803 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-20 00:37:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-20 00:37:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2548. [2022-07-20 00:37:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1962 states have (on average 1.4653414882772682) internal successors, (2875), 1981 states have internal predecessors, (2875), 480 states have call successors, (480), 106 states have call predecessors, (480), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-20 00:37:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3831 transitions. [2022-07-20 00:37:27,484 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3831 transitions. Word has length 25 [2022-07-20 00:37:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:27,485 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3831 transitions. [2022-07-20 00:37:27,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3831 transitions. [2022-07-20 00:37:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 00:37:27,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:27,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:27,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:37:27,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:27,487 INFO L85 PathProgramCache]: Analyzing trace with hash -491175993, now seen corresponding path program 1 times [2022-07-20 00:37:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:27,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195790119] [2022-07-20 00:37:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:27,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 00:37:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:27,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195790119] [2022-07-20 00:37:27,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195790119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:27,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:27,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:37:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226568850] [2022-07-20 00:37:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:27,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:37:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:37:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:37:27,647 INFO L87 Difference]: Start difference. First operand 2548 states and 3831 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:28,871 INFO L93 Difference]: Finished difference Result 2558 states and 3852 transitions. [2022-07-20 00:37:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:37:28,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-20 00:37:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:28,882 INFO L225 Difference]: With dead ends: 2558 [2022-07-20 00:37:28,884 INFO L226 Difference]: Without dead ends: 2555 [2022-07-20 00:37:28,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:37:28,889 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1061 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:28,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1800 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 00:37:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2022-07-20 00:37:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2547. [2022-07-20 00:37:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 1962 states have (on average 1.4648318042813455) internal successors, (2874), 1980 states have internal predecessors, (2874), 479 states have call successors, (479), 106 states have call predecessors, (479), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-20 00:37:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3829 transitions. [2022-07-20 00:37:28,978 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3829 transitions. Word has length 26 [2022-07-20 00:37:28,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:28,979 INFO L495 AbstractCegarLoop]: Abstraction has 2547 states and 3829 transitions. [2022-07-20 00:37:28,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3829 transitions. [2022-07-20 00:37:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 00:37:28,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:28,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:28,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:37:28,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:28,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1953265320, now seen corresponding path program 1 times [2022-07-20 00:37:28,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:28,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315594718] [2022-07-20 00:37:28,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:28,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:29,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 00:37:29,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:29,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315594718] [2022-07-20 00:37:29,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315594718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:29,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:29,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 00:37:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001385844] [2022-07-20 00:37:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:29,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:37:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:29,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:37:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 00:37:29,137 INFO L87 Difference]: Start difference. First operand 2547 states and 3829 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:31,728 INFO L93 Difference]: Finished difference Result 7585 states and 11451 transitions. [2022-07-20 00:37:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:37:31,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-20 00:37:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:31,788 INFO L225 Difference]: With dead ends: 7585 [2022-07-20 00:37:31,788 INFO L226 Difference]: Without dead ends: 5029 [2022-07-20 00:37:31,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 00:37:31,799 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1126 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:31,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2805 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-20 00:37:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2022-07-20 00:37:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5004. [2022-07-20 00:37:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 3857 states have (on average 1.467461757842883) internal successors, (5660), 3900 states have internal predecessors, (5660), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-20 00:37:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 7548 transitions. [2022-07-20 00:37:32,102 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 7548 transitions. Word has length 27 [2022-07-20 00:37:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:32,102 INFO L495 AbstractCegarLoop]: Abstraction has 5004 states and 7548 transitions. [2022-07-20 00:37:32,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 00:37:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 7548 transitions. [2022-07-20 00:37:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 00:37:32,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:32,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:32,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:37:32,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1400463080, now seen corresponding path program 1 times [2022-07-20 00:37:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186771942] [2022-07-20 00:37:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-20 00:37:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:37:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-20 00:37:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-20 00:37:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 00:37:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:32,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186771942] [2022-07-20 00:37:32,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186771942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:32,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:32,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:37:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388963674] [2022-07-20 00:37:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:32,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:37:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:37:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:37:32,384 INFO L87 Difference]: Start difference. First operand 5004 states and 7548 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 00:37:37,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:37:39,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:37:42,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:37:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:43,745 INFO L93 Difference]: Finished difference Result 10466 states and 15931 transitions. [2022-07-20 00:37:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:37:43,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2022-07-20 00:37:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:43,771 INFO L225 Difference]: With dead ends: 10466 [2022-07-20 00:37:43,772 INFO L226 Difference]: Without dead ends: 5461 [2022-07-20 00:37:43,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:37:43,789 INFO L413 NwaCegarLoop]: 1100 mSDtfsCounter, 182 mSDsluCounter, 3754 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 154 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 4854 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:43,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 4854 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1295 Invalid, 3 Unknown, 0 Unchecked, 11.2s Time] [2022-07-20 00:37:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2022-07-20 00:37:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5006. [2022-07-20 00:37:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 3859 states have (on average 1.4661829489505054) internal successors, (5658), 3902 states have internal predecessors, (5658), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-20 00:37:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7546 transitions. [2022-07-20 00:37:44,000 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7546 transitions. Word has length 77 [2022-07-20 00:37:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:44,001 INFO L495 AbstractCegarLoop]: Abstraction has 5006 states and 7546 transitions. [2022-07-20 00:37:44,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-20 00:37:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7546 transitions. [2022-07-20 00:37:44,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-20 00:37:44,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:44,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:37:44,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:37:44,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:44,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1710126176, now seen corresponding path program 1 times [2022-07-20 00:37:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:44,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214328025] [2022-07-20 00:37:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:44,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 00:37:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 00:37:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-20 00:37:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:37:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:37:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-20 00:37:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 00:37:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:44,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214328025] [2022-07-20 00:37:44,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214328025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:44,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:44,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:37:44,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984970080] [2022-07-20 00:37:44,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:44,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:37:44,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:44,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:37:44,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:37:44,203 INFO L87 Difference]: Start difference. First operand 5006 states and 7546 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 00:37:48,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:37:50,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:37:52,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:37:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:37:54,408 INFO L93 Difference]: Finished difference Result 11182 states and 17097 transitions. [2022-07-20 00:37:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:37:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2022-07-20 00:37:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:37:54,439 INFO L225 Difference]: With dead ends: 11182 [2022-07-20 00:37:54,439 INFO L226 Difference]: Without dead ends: 6179 [2022-07-20 00:37:54,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:37:54,455 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 728 mSDsluCounter, 3609 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 339 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4959 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-20 00:37:54,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4959 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1066 Invalid, 3 Unknown, 0 Unchecked, 10.0s Time] [2022-07-20 00:37:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-20 00:37:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5014. [2022-07-20 00:37:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5014 states, 3867 states have (on average 1.465218515645203) internal successors, (5666), 3910 states have internal predecessors, (5666), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-20 00:37:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 7554 transitions. [2022-07-20 00:37:54,617 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 7554 transitions. Word has length 104 [2022-07-20 00:37:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:37:54,618 INFO L495 AbstractCegarLoop]: Abstraction has 5014 states and 7554 transitions. [2022-07-20 00:37:54,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-20 00:37:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 7554 transitions. [2022-07-20 00:37:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-20 00:37:54,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:37:54,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 00:37:54,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:37:54,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:37:54,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:37:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1744883690, now seen corresponding path program 1 times [2022-07-20 00:37:54,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:37:54,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101856350] [2022-07-20 00:37:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:37:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:37:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:37:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 00:37:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 00:37:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-20 00:37:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:37:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:37:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-20 00:37:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:37:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:37:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 00:37:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:37:54,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101856350] [2022-07-20 00:37:54,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101856350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:37:54,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:37:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:37:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83903814] [2022-07-20 00:37:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:37:54,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:37:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:37:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:37:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:37:54,816 INFO L87 Difference]: Start difference. First operand 5014 states and 7554 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-20 00:37:58,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:00,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:02,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:38:04,312 INFO L93 Difference]: Finished difference Result 10407 states and 16031 transitions. [2022-07-20 00:38:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:38:04,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2022-07-20 00:38:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:38:04,355 INFO L225 Difference]: With dead ends: 10407 [2022-07-20 00:38:04,356 INFO L226 Difference]: Without dead ends: 5396 [2022-07-20 00:38:04,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:38:04,415 INFO L413 NwaCegarLoop]: 1004 mSDtfsCounter, 1194 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 468 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:38:04,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 2243 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 513 Invalid, 3 Unknown, 0 Unchecked, 9.3s Time] [2022-07-20 00:38:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-07-20 00:38:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4990. [2022-07-20 00:38:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3851 states have (on average 1.3996364580628409) internal successors, (5390), 3894 states have internal predecessors, (5390), 941 states have call successors, (941), 205 states have call predecessors, (941), 197 states have return successors, (931), 922 states have call predecessors, (931), 931 states have call successors, (931) [2022-07-20 00:38:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 7262 transitions. [2022-07-20 00:38:04,637 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 7262 transitions. Word has length 102 [2022-07-20 00:38:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:38:04,639 INFO L495 AbstractCegarLoop]: Abstraction has 4990 states and 7262 transitions. [2022-07-20 00:38:04,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-20 00:38:04,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 7262 transitions. [2022-07-20 00:38:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 00:38:04,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:38:04,645 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:38:04,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:38:04,645 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:38:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:38:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1621242927, now seen corresponding path program 1 times [2022-07-20 00:38:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:38:04,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729228866] [2022-07-20 00:38:04,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:38:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:38:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:38:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-20 00:38:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-20 00:38:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-20 00:38:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 00:38:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:38:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-20 00:38:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-20 00:38:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 00:38:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:38:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729228866] [2022-07-20 00:38:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729228866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:38:04,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:38:04,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:38:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688606237] [2022-07-20 00:38:04,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:38:04,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:38:04,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:38:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:38:04,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:38:04,858 INFO L87 Difference]: Start difference. First operand 4990 states and 7262 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-20 00:38:10,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:12,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:14,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:16,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:18,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:20,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:38:22,660 INFO L93 Difference]: Finished difference Result 15758 states and 23270 transitions. [2022-07-20 00:38:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:38:22,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2022-07-20 00:38:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:38:22,701 INFO L225 Difference]: With dead ends: 15758 [2022-07-20 00:38:22,702 INFO L226 Difference]: Without dead ends: 10771 [2022-07-20 00:38:22,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:38:22,720 INFO L413 NwaCegarLoop]: 1676 mSDtfsCounter, 1264 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 537 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:38:22,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 4539 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 1201 Invalid, 6 Unknown, 0 Unchecked, 17.4s Time] [2022-07-20 00:38:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2022-07-20 00:38:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9936. [2022-07-20 00:38:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9936 states, 7665 states have (on average 1.3993476842791912) internal successors, (10726), 7750 states have internal predecessors, (10726), 1877 states have call successors, (1877), 407 states have call predecessors, (1877), 393 states have return successors, (1861), 1842 states have call predecessors, (1861), 1861 states have call successors, (1861) [2022-07-20 00:38:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9936 states to 9936 states and 14464 transitions. [2022-07-20 00:38:23,189 INFO L78 Accepts]: Start accepts. Automaton has 9936 states and 14464 transitions. Word has length 108 [2022-07-20 00:38:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:38:23,190 INFO L495 AbstractCegarLoop]: Abstraction has 9936 states and 14464 transitions. [2022-07-20 00:38:23,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-20 00:38:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 9936 states and 14464 transitions. [2022-07-20 00:38:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 00:38:23,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:38:23,193 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:38:23,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:38:23,194 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:38:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:38:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1012080502, now seen corresponding path program 1 times [2022-07-20 00:38:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:38:23,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200530232] [2022-07-20 00:38:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:38:23,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:38:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:38:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:38:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:38:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:38:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:38:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:38:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-20 00:38:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-20 00:38:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 00:38:23,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:38:23,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200530232] [2022-07-20 00:38:23,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200530232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:38:23,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:38:23,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:38:23,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633847182] [2022-07-20 00:38:23,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:38:23,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:38:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:38:23,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:38:23,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:38:23,358 INFO L87 Difference]: Start difference. First operand 9936 states and 14464 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-20 00:38:28,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:30,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:32,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:34,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:36,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:39,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:38:41,072 INFO L93 Difference]: Finished difference Result 25936 states and 38367 transitions. [2022-07-20 00:38:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:38:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2022-07-20 00:38:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:38:41,152 INFO L225 Difference]: With dead ends: 25936 [2022-07-20 00:38:41,152 INFO L226 Difference]: Without dead ends: 16003 [2022-07-20 00:38:41,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:38:41,175 INFO L413 NwaCegarLoop]: 1721 mSDtfsCounter, 1183 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 642 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 4496 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:38:41,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 4496 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 1217 Invalid, 6 Unknown, 0 Unchecked, 17.2s Time] [2022-07-20 00:38:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16003 states. [2022-07-20 00:38:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16003 to 14784. [2022-07-20 00:38:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14784 states, 11449 states have (on average 1.3945322735610097) internal successors, (15966), 11566 states have internal predecessors, (15966), 2761 states have call successors, (2761), 587 states have call predecessors, (2761), 573 states have return successors, (2745), 2726 states have call predecessors, (2745), 2745 states have call successors, (2745) [2022-07-20 00:38:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 21472 transitions. [2022-07-20 00:38:41,685 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 21472 transitions. Word has length 110 [2022-07-20 00:38:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:38:41,686 INFO L495 AbstractCegarLoop]: Abstraction has 14784 states and 21472 transitions. [2022-07-20 00:38:41,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-20 00:38:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 21472 transitions. [2022-07-20 00:38:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-20 00:38:41,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:38:41,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:38:41,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 00:38:41,692 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:38:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:38:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1582291269, now seen corresponding path program 1 times [2022-07-20 00:38:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:38:41,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375174243] [2022-07-20 00:38:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:38:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:38:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:38:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:38:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:38:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:38:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:38:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:38:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 00:38:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-20 00:38:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:38:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:38:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-20 00:38:41,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:38:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375174243] [2022-07-20 00:38:41,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375174243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:38:41,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:38:41,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:38:41,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080357398] [2022-07-20 00:38:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:38:41,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:38:41,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:38:41,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:38:41,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:38:41,854 INFO L87 Difference]: Start difference. First operand 14784 states and 21472 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 00:38:47,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:49,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:51,937 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:54,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:56,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:38:58,276 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:39:00,386 INFO L93 Difference]: Finished difference Result 36024 states and 53119 transitions. [2022-07-20 00:39:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:39:00,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 131 [2022-07-20 00:39:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:39:00,495 INFO L225 Difference]: With dead ends: 36024 [2022-07-20 00:39:00,495 INFO L226 Difference]: Without dead ends: 21243 [2022-07-20 00:39:00,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:39:00,530 INFO L413 NwaCegarLoop]: 1911 mSDtfsCounter, 1202 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 613 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 4998 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:39:00,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 4998 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1235 Invalid, 6 Unknown, 0 Unchecked, 17.9s Time] [2022-07-20 00:39:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21243 states. [2022-07-20 00:39:01,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21243 to 19632. [2022-07-20 00:39:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19632 states, 15233 states have (on average 1.3921092365259633) internal successors, (21206), 15382 states have internal predecessors, (21206), 3645 states have call successors, (3645), 767 states have call predecessors, (3645), 753 states have return successors, (3629), 3610 states have call predecessors, (3629), 3629 states have call successors, (3629) [2022-07-20 00:39:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19632 states to 19632 states and 28480 transitions. [2022-07-20 00:39:01,262 INFO L78 Accepts]: Start accepts. Automaton has 19632 states and 28480 transitions. Word has length 131 [2022-07-20 00:39:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:39:01,263 INFO L495 AbstractCegarLoop]: Abstraction has 19632 states and 28480 transitions. [2022-07-20 00:39:01,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-20 00:39:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 19632 states and 28480 transitions. [2022-07-20 00:39:01,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-20 00:39:01,270 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:39:01,270 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:39:01,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 00:39:01,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:39:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:39:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1020367177, now seen corresponding path program 1 times [2022-07-20 00:39:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:39:01,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516622319] [2022-07-20 00:39:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:39:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:39:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:39:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:39:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:39:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:39:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:39:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:39:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 00:39:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:39:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 00:39:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 00:39:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 00:39:01,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:39:01,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516622319] [2022-07-20 00:39:01,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516622319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:39:01,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:39:01,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:39:01,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181080902] [2022-07-20 00:39:01,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:39:01,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:39:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:39:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:39:01,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:39:01,431 INFO L87 Difference]: Start difference. First operand 19632 states and 28480 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:39:08,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:10,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:12,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:14,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:17,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:19,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:21,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:23,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:25,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:27,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:29,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:31,392 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:34,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:36,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:38,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:40,885 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:42,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:44,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:46,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:49,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:39:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:39:53,584 INFO L93 Difference]: Finished difference Result 46112 states and 67871 transitions. [2022-07-20 00:39:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 00:39:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-20 00:39:53,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:39:53,681 INFO L225 Difference]: With dead ends: 46112 [2022-07-20 00:39:53,682 INFO L226 Difference]: Without dead ends: 26483 [2022-07-20 00:39:53,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-20 00:39:53,719 INFO L413 NwaCegarLoop]: 1722 mSDtfsCounter, 1446 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 4901 mSolverCounterSat, 835 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 5756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Valid, 4901 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:39:53,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 3420 Invalid, 5756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [835 Valid, 4901 Invalid, 20 Unknown, 0 Unchecked, 51.3s Time] [2022-07-20 00:39:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2022-07-20 00:39:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 24480. [2022-07-20 00:39:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24480 states, 19017 states have (on average 1.3906504706315401) internal successors, (26446), 19198 states have internal predecessors, (26446), 4529 states have call successors, (4529), 947 states have call predecessors, (4529), 933 states have return successors, (4513), 4494 states have call predecessors, (4513), 4513 states have call successors, (4513) [2022-07-20 00:39:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35488 transitions. [2022-07-20 00:39:54,970 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35488 transitions. Word has length 152 [2022-07-20 00:39:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:39:54,971 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35488 transitions. [2022-07-20 00:39:54,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:39:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35488 transitions. [2022-07-20 00:39:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-20 00:39:54,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:39:54,993 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2022-07-20 00:39:54,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 00:39:54,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:39:54,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:39:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2130073905, now seen corresponding path program 1 times [2022-07-20 00:39:54,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:39:54,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578548350] [2022-07-20 00:39:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:39:54,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:39:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:39:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:39:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:39:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:39:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:39:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:39:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-20 00:39:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:39:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:39:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 00:39:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 00:39:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:39:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-20 00:39:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:39:55,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578548350] [2022-07-20 00:39:55,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578548350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:39:55,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:39:55,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 00:39:55,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516806885] [2022-07-20 00:39:55,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:39:55,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 00:39:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:39:55,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 00:39:55,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:39:55,259 INFO L87 Difference]: Start difference. First operand 24480 states and 35488 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:40:00,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:02,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:04,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:06,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:09,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:11,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:13,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:15,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:17,357 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:19,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:21,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:23,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:40:26,675 INFO L93 Difference]: Finished difference Result 50943 states and 74695 transitions. [2022-07-20 00:40:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:40:26,676 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2022-07-20 00:40:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:40:26,771 INFO L225 Difference]: With dead ends: 50943 [2022-07-20 00:40:26,772 INFO L226 Difference]: Without dead ends: 26466 [2022-07-20 00:40:26,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:40:26,814 INFO L413 NwaCegarLoop]: 953 mSDtfsCounter, 1740 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 1058 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 4172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:40:26,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 2198 Invalid, 4172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 3102 Invalid, 12 Unknown, 0 Unchecked, 30.4s Time] [2022-07-20 00:40:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2022-07-20 00:40:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 24480. [2022-07-20 00:40:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24480 states, 19017 states have (on average 1.3904401325130147) internal successors, (26442), 19198 states have internal predecessors, (26442), 4529 states have call successors, (4529), 947 states have call predecessors, (4529), 933 states have return successors, (4513), 4494 states have call predecessors, (4513), 4513 states have call successors, (4513) [2022-07-20 00:40:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35484 transitions. [2022-07-20 00:40:27,720 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35484 transitions. Word has length 153 [2022-07-20 00:40:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:40:27,720 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35484 transitions. [2022-07-20 00:40:27,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:40:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35484 transitions. [2022-07-20 00:40:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-20 00:40:27,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:40:27,730 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:40:27,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 00:40:27,730 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:40:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:40:27,731 INFO L85 PathProgramCache]: Analyzing trace with hash 574017791, now seen corresponding path program 1 times [2022-07-20 00:40:27,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:40:27,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409227236] [2022-07-20 00:40:27,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:40:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:40:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:40:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:40:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:40:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:40:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:40:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:40:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:40:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:40:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:40:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 00:40:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:40:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:40:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 00:40:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 00:40:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:40:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 00:40:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:40:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409227236] [2022-07-20 00:40:27,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409227236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:40:27,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:40:27,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:40:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401258963] [2022-07-20 00:40:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:40:27,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:40:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:40:27,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:40:27,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:40:27,901 INFO L87 Difference]: Start difference. First operand 24480 states and 35484 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:40:33,058 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 [] [2022-07-20 00:40:36,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:38,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:40,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:42,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:44,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:46,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:48,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:50,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:53,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:55,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:57,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:40:58,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:01,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:03,108 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 [] [2022-07-20 00:41:05,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:08,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:10,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:12,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:14,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:16,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:21,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:41:21,079 INFO L93 Difference]: Finished difference Result 56200 states and 82615 transitions. [2022-07-20 00:41:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 00:41:21,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-20 00:41:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:41:21,208 INFO L225 Difference]: With dead ends: 56200 [2022-07-20 00:41:21,208 INFO L226 Difference]: Without dead ends: 31723 [2022-07-20 00:41:21,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-20 00:41:21,262 INFO L413 NwaCegarLoop]: 1727 mSDtfsCounter, 1438 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 4919 mSolverCounterSat, 838 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1556 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 5775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 838 IncrementalHoareTripleChecker+Valid, 4919 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:41:21,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1556 Valid, 3385 Invalid, 5775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [838 Valid, 4919 Invalid, 18 Unknown, 0 Unchecked, 52.1s Time] [2022-07-20 00:41:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31723 states. [2022-07-20 00:41:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31723 to 29328. [2022-07-20 00:41:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29328 states, 22801 states have (on average 1.389500460506118) internal successors, (31682), 23014 states have internal predecessors, (31682), 5413 states have call successors, (5413), 1127 states have call predecessors, (5413), 1113 states have return successors, (5397), 5378 states have call predecessors, (5397), 5397 states have call successors, (5397) [2022-07-20 00:41:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29328 states to 29328 states and 42492 transitions. [2022-07-20 00:41:22,393 INFO L78 Accepts]: Start accepts. Automaton has 29328 states and 42492 transitions. Word has length 152 [2022-07-20 00:41:22,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:41:22,393 INFO L495 AbstractCegarLoop]: Abstraction has 29328 states and 42492 transitions. [2022-07-20 00:41:22,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:41:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29328 states and 42492 transitions. [2022-07-20 00:41:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-20 00:41:22,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:41:22,403 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-07-20 00:41:22,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 00:41:22,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:41:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:41:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 440004285, now seen corresponding path program 1 times [2022-07-20 00:41:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:41:22,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791767939] [2022-07-20 00:41:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:41:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:41:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 00:41:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 00:41:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:41:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-20 00:41:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:41:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-20 00:41:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-20 00:41:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:41:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:41:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-20 00:41:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:41:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:41:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-20 00:41:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-20 00:41:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:41:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 00:41:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:41:22,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791767939] [2022-07-20 00:41:22,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791767939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:41:22,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:41:22,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 00:41:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474599891] [2022-07-20 00:41:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:41:22,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 00:41:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:41:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 00:41:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:41:22,673 INFO L87 Difference]: Start difference. First operand 29328 states and 42492 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-20 00:41:27,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:29,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:32,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:33,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:35,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:37,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:39,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:41,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:41:43,685 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 []