./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.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 89a6e0c14d7953b2e25131531535c77ad505202a25ee17b376492f1e71d3ad6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 23:58:32,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:58:32,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:58:32,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:58:32,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:58:32,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:58:32,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:58:32,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:58:32,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:58:32,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:58:32,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:58:32,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:58:32,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:58:32,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:58:32,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:58:32,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:58:32,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:58:32,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:58:32,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:58:32,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:58:32,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:58:32,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:58:32,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:58:32,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:58:32,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:58:32,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:58:32,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:58:32,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:58:32,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:58:32,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:58:32,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:58:32,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:58:32,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:58:32,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:58:32,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:58:32,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:58:32,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:58:32,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:58:32,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:58:32,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:58:32,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:58:32,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:58:32,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:58:32,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:58:32,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:58:32,481 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:58:32,481 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:58:32,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:58:32,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:58:32,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:58:32,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:58:32,483 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:58:32,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:58:32,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:58:32,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:58:32,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:58:32,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:58:32,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:58:32,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:58:32,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:58:32,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:58:32,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:58:32,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:58:32,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:58:32,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:58:32,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:58:32,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:58:32,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:58:32,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:58:32,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:58:32,488 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:58:32,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:58:32,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:58:32,489 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 -> 89a6e0c14d7953b2e25131531535c77ad505202a25ee17b376492f1e71d3ad6d [2022-07-13 23:58:32,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:58:32,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:58:32,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:58:32,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:58:32,713 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:58:32,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-13 23:58:32,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760cf9f6d/fe6b1d64fdfd4c4f992c3e87949429fb/FLAGd35769584 [2022-07-13 23:58:33,564 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:58:33,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-13 23:58:33,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760cf9f6d/fe6b1d64fdfd4c4f992c3e87949429fb/FLAGd35769584 [2022-07-13 23:58:33,795 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760cf9f6d/fe6b1d64fdfd4c4f992c3e87949429fb [2022-07-13 23:58:33,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:58:33,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:58:33,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:58:33,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:58:33,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:58:33,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:58:33" (1/1) ... [2022-07-13 23:58:33,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f165917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:33, skipping insertion in model container [2022-07-13 23:58:33,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:58:33" (1/1) ... [2022-07-13 23:58:33,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:58:34,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:58:34,912 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-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-13 23:58:36,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:58:36,432 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:58:36,543 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-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-13 23:58:36,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:58:37,048 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:58:37,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37 WrapperNode [2022-07-13 23:58:37,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:58:37,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:58:37,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:58:37,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:58:37,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,462 INFO L137 Inliner]: procedures = 367, calls = 4074, calls flagged for inlining = 161, calls inlined = 138, statements flattened = 10019 [2022-07-13 23:58:37,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:58:37,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:58:37,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:58:37,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:58:37,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:58:37,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:58:37,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:58:37,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:58:37,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (1/1) ... [2022-07-13 23:58:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:58:38,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:58:38,020 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-13 23:58:38,040 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-13 23:58:38,062 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_free [2022-07-13 23:58:38,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_free [2022-07-13 23:58:38,062 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_mmap [2022-07-13 23:58:38,062 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_mmap [2022-07-13 23:58:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2022-07-13 23:58:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2022-07-13 23:58:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-13 23:58:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-13 23:58:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_compat_ioctl [2022-07-13 23:58:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_compat_ioctl [2022-07-13 23:58:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure remove_wait_queue [2022-07-13 23:58:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_wait_queue [2022-07-13 23:58:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-13 23:58:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-13 23:58:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-13 23:58:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-13 23:58:38,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-13 23:58:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_running [2022-07-13 23:58:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_running [2022-07-13 23:58:38,065 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_alloc [2022-07-13 23:58:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_alloc [2022-07-13 23:58:38,065 INFO L130 BoogieDeclarations]: Found specification of procedure compat_chaninfo [2022-07-13 23:58:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_chaninfo [2022-07-13 23:58:38,065 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_cleanup [2022-07-13 23:58:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_cleanup [2022-07-13 23:58:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write_subdevice [2022-07-13 23:58:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write_subdevice [2022-07-13 23:58:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure max_write_buffer_kb_show [2022-07-13 23:58:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure max_write_buffer_kb_show [2022-07-13 23:58:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_set_subdevice_runflags [2022-07-13 23:58:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_set_subdevice_runflags [2022-07-13 23:58:38,066 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2022-07-13 23:58:38,066 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2022-07-13 23:58:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-13 23:58:38,067 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-13 23:58:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:58:38,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:58:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-13 23:58:38,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-13 23:58:38,067 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_read_subdevice [2022-07-13 23:58:38,068 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_read_subdevice [2022-07-13 23:58:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_free [2022-07-13 23:58:38,068 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_free [2022-07-13 23:58:38,068 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_open [2022-07-13 23:58:38,068 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_open [2022-07-13 23:58:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 23:58:38,069 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 23:58:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:58:38,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:58:38,069 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-13 23:58:38,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-13 23:58:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure compat_rangeinfo [2022-07-13 23:58:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_rangeinfo [2022-07-13 23:58:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insn [2022-07-13 23:58:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insn [2022-07-13 23:58:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insnlist [2022-07-13 23:58:38,071 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insnlist [2022-07-13 23:58:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_alloc [2022-07-13 23:58:38,072 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_alloc [2022-07-13 23:58:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2022-07-13 23:58:38,072 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_fasync [2022-07-13 23:58:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_fasync [2022-07-13 23:58:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 23:58:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 23:58:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure bytes_per_sample [2022-07-13 23:58:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure bytes_per_sample [2022-07-13 23:58:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-13 23:58:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-13 23:58:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 23:58:38,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 23:58:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_alloc_board_minor [2022-07-13 23:58:38,074 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_alloc_board_minor [2022-07-13 23:58:38,074 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-13 23:58:38,075 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-13 23:58:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_poll [2022-07-13 23:58:38,075 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_poll [2022-07-13 23:58:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_n_available [2022-07-13 23:58:38,075 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_n_available [2022-07-13 23:58:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-13 23:58:38,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-13 23:58:38,075 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-07-13 23:58:38,076 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-07-13 23:58:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-13 23:58:38,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-13 23:58:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_cmd [2022-07-13 23:58:38,076 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_cmd [2022-07-13 23:58:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:58:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:58:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-13 23:58:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-13 23:58:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-13 23:58:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-13 23:58:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_alloc [2022-07-13 23:58:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_alloc [2022-07-13 23:58:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-13 23:58:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-13 23:58:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-13 23:58:38,079 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-13 23:58:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_in_error [2022-07-13 23:58:38,079 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_in_error [2022-07-13 23:58:38,079 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_detach [2022-07-13 23:58:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_detach [2022-07-13 23:58:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_check_chanlist [2022-07-13 23:58:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_check_chanlist [2022-07-13 23:58:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:58:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:58:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-13 23:58:38,080 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-13 23:58:38,080 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write [2022-07-13 23:58:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write [2022-07-13 23:58:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-13 23:58:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-13 23:58:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-13 23:58:38,081 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-13 23:58:38,081 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:58:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:58:38,082 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_proc_open [2022-07-13 23:58:38,082 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_proc_open [2022-07-13 23:58:38,083 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2022-07-13 23:58:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2022-07-13 23:58:38,085 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 23:58:38,085 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 23:58:38,086 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-13 23:58:38,087 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-13 23:58:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-13 23:58:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-13 23:58:38,088 INFO L130 BoogieDeclarations]: Found specification of procedure add_wait_queue [2022-07-13 23:58:38,088 INFO L138 BoogieDeclarations]: Found implementation of procedure add_wait_queue [2022-07-13 23:58:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-13 23:58:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-13 23:58:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-13 23:58:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-13 23:58:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-13 23:58:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-13 23:58:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_postconfig [2022-07-13 23:58:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_postconfig [2022-07-13 23:58:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-13 23:58:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-13 23:58:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure max_read_buffer_kb_show [2022-07-13 23:58:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure max_read_buffer_kb_show [2022-07-13 23:58:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-13 23:58:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-13 23:58:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_free_board_dev [2022-07-13 23:58:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_free_board_dev [2022-07-13 23:58:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_free [2022-07-13 23:58:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_free [2022-07-13 23:58:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_dev_from_minor [2022-07-13 23:58:38,096 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_dev_from_minor [2022-07-13 23:58:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:58:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure compat_alloc_user_space [2022-07-13 23:58:38,096 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_alloc_user_space [2022-07-13 23:58:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_cleanup_board_minors [2022-07-13 23:58:38,096 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_cleanup_board_minors [2022-07-13 23:58:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-13 23:58:38,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-13 23:58:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_close [2022-07-13 23:58:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_close [2022-07-13 23:58:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_write_alloc [2022-07-13 23:58:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_write_alloc [2022-07-13 23:58:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure write_buffer_kb_show [2022-07-13 23:58:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure write_buffer_kb_show [2022-07-13 23:58:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmd [2022-07-13 23:58:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmd [2022-07-13 23:58:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:58:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:58:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2022-07-13 23:58:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-13 23:58:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-13 23:58:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:58:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-13 23:58:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-13 23:58:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2022-07-13 23:58:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2022-07-13 23:58:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-13 23:58:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-13 23:58:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_subdevice_from_minor [2022-07-13 23:58:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_subdevice_from_minor [2022-07-13 23:58:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmdtest [2022-07-13 23:58:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmdtest [2022-07-13 23:58:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure read_buffer_kb_show [2022-07-13 23:58:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure read_buffer_kb_show [2022-07-13 23:58:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2022-07-13 23:58:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2022-07-13 23:58:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:58:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure insn_rw_emulate_bits [2022-07-13 23:58:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure insn_rw_emulate_bits [2022-07-13 23:58:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:58:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:58:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-13 23:58:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-13 23:58:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:58:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_n_allocated [2022-07-13 23:58:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_n_allocated [2022-07-13 23:58:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_close [2022-07-13 23:58:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_close [2022-07-13 23:58:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:58:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_open [2022-07-13 23:58:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_open [2022-07-13 23:58:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-13 23:58:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 23:58:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 23:58:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_idle [2022-07-13 23:58:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_idle [2022-07-13 23:58:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-13 23:58:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-13 23:58:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-13 23:58:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-13 23:58:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure translated_ioctl [2022-07-13 23:58:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure translated_ioctl [2022-07-13 23:58:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-13 23:58:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-13 23:58:38,103 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-13 23:58:38,103 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-13 23:58:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure raw_ioctl [2022-07-13 23:58:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_ioctl [2022-07-13 23:58:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_reset [2022-07-13 23:58:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_reset [2022-07-13 23:58:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure resize_async_buffer [2022-07-13 23:58:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure resize_async_buffer [2022-07-13 23:58:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure parse_insn [2022-07-13 23:58:38,104 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_insn [2022-07-13 23:58:38,104 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_get_subdevice_runflags [2022-07-13 23:58:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_get_subdevice_runflags [2022-07-13 23:58:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:58:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-13 23:58:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-13 23:58:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-13 23:58:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure do_become_nonbusy [2022-07-13 23:58:38,105 INFO L138 BoogieDeclarations]: Found implementation of procedure do_become_nonbusy [2022-07-13 23:58:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_unlocked_ioctl [2022-07-13 23:58:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_unlocked_ioctl [2022-07-13 23:58:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure do_cancel [2022-07-13 23:58:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure do_cancel [2022-07-13 23:58:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_insn [2022-07-13 23:58:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_insn [2022-07-13 23:58:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:58:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtouint [2022-07-13 23:58:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtouint [2022-07-13 23:58:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:58:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:58:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-13 23:58:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-13 23:58:39,120 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:58:39,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:58:39,708 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-13 23:58:42,319 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume 0 != aref_invalid_~tmp~66#1;havoc aref_invalid_#t~nondet1322#1; [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume !(0 != aref_invalid_~tmp~66#1); [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9037: aref_invalid_#res#1 := 1;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !(0 == aref_invalid_~chanspec#1 / 16777216); [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9021: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1318#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9021: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 3 == aref_invalid_~aref~0#1; [2022-07-13 23:58:42,397 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume 0 == aref_invalid_~chanspec#1 / 16777216;aref_invalid_~aref~0#1 := 0; [2022-07-13 23:58:42,398 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9022: assume 0 != (if 0 == aref_invalid_#t~mem1318#1 then 0 else (if 1 == aref_invalid_#t~mem1318#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1318#1, 1048576)));havoc aref_invalid_#t~mem1318#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-13 23:58:42,398 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9022: assume !(0 != (if 0 == aref_invalid_#t~mem1318#1 then 0 else (if 1 == aref_invalid_#t~mem1318#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1318#1, 1048576))));havoc aref_invalid_#t~mem1318#1; [2022-07-13 23:58:42,399 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9015: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1317#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-13 23:58:42,399 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9015: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 0 == aref_invalid_~aref~0#1; [2022-07-13 23:58:42,399 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume false;aref_invalid_~aref~0#1 := aref_invalid_~chanspec#1 / 16777216; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume !false; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-4: assume aref_invalid_~chanspec#1 / 16777216 >= 0;abs_9007 := (if aref_invalid_~chanspec#1 / 16777216 < 3 then aref_invalid_~chanspec#1 / 16777216 else 3);assume aref_invalid_~chanspec#1 / 16777216 >= 0;assume aref_invalid_~aref~0#1 < abs_9007; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-4: assume !(aref_invalid_~chanspec#1 / 16777216 >= 0);aref_invalid_~aref~0#1 := aref_invalid_#t~nondet1314#1;havoc aref_invalid_#t~nondet1314#1; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume false;aref_invalid_~aref~0#1 := 3; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume !false; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-6: aref_invalid_#t~switch1315#1 := 2 == aref_invalid_~aref~0#1; [2022-07-13 23:58:42,400 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9016: assume 0 != (if 0 == aref_invalid_#t~mem1317#1 then 0 else (if 1 == aref_invalid_#t~mem1317#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1317#1, 2097152)));havoc aref_invalid_#t~mem1317#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9016: assume !(0 != (if 0 == aref_invalid_#t~mem1317#1 then 0 else (if 1 == aref_invalid_#t~mem1317#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1317#1, 2097152))));havoc aref_invalid_#t~mem1317#1; [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9008: havoc aref_invalid_#t~switch1315#1; [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume aref_invalid_#t~switch1315#1; [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume !aref_invalid_#t~switch1315#1; [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1316#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 1 == aref_invalid_~aref~0#1; [2022-07-13 23:58:42,401 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: assume 0 != (if 0 == aref_invalid_#t~mem1316#1 then 0 else (if 1 == aref_invalid_#t~mem1316#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1316#1, 4194304)));havoc aref_invalid_#t~mem1316#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-13 23:58:42,402 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: assume !(0 != (if 0 == aref_invalid_#t~mem1316#1 then 0 else (if 1 == aref_invalid_#t~mem1316#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1316#1, 4194304))));havoc aref_invalid_#t~mem1316#1; [2022-07-13 23:58:42,402 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1319#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-13 23:58:42,402 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := true; [2022-07-13 23:58:42,402 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044: SUMMARY for call aref_invalid_#t~ret1321#1 := ldv__builtin_expect(aref_invalid_#t~mem1320#1 % 256, 0); srcloc: null [2022-07-13 23:58:42,402 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044-1: assume -9223372036854775808 <= aref_invalid_#t~ret1321#1 && aref_invalid_#t~ret1321#1 <= 9223372036854775807;aref_invalid_~tmp~66#1 := aref_invalid_#t~ret1321#1;havoc aref_invalid_#t~mem1320#1;havoc aref_invalid_#t~ret1321#1; [2022-07-13 23:58:42,406 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume 0 != ~comedi_debug~0;call write~$Pointer$(302, 0, aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(303, 0, aref_invalid_~#descriptor~14#1.base, 8 + aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(304, 0, aref_invalid_~#descriptor~14#1.base, 16 + aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(305, 0, aref_invalid_~#descriptor~14#1.base, 24 + aref_invalid_~#descriptor~14#1.offset, 8);call write~int(168, aref_invalid_~#descriptor~14#1.base, 32 + aref_invalid_~#descriptor~14#1.offset, 4);call write~int(0, aref_invalid_~#descriptor~14#1.base, 36 + aref_invalid_~#descriptor~14#1.offset, 1);call aref_invalid_#t~mem1320#1 := read~int(aref_invalid_~#descriptor~14#1.base, 36 + aref_invalid_~#descriptor~14#1.offset, 1); [2022-07-13 23:58:42,406 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume !(0 != ~comedi_debug~0); [2022-07-13 23:58:42,407 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9028: assume 0 != (if 0 == aref_invalid_#t~mem1319#1 then 0 else (if 1 == aref_invalid_#t~mem1319#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1319#1, 8388608)));havoc aref_invalid_#t~mem1319#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-13 23:58:42,407 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9028: assume !(0 != (if 0 == aref_invalid_#t~mem1319#1 then 0 else (if 1 == aref_invalid_#t~mem1319#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1319#1, 8388608))));havoc aref_invalid_#t~mem1319#1; [2022-07-13 23:58:51,370 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:58:51,403 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:58:51,403 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 23:58:51,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:58:51 BoogieIcfgContainer [2022-07-13 23:58:51,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:58:51,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:58:51,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:58:51,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:58:51,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:58:33" (1/3) ... [2022-07-13 23:58:51,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4c59eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:58:51, skipping insertion in model container [2022-07-13 23:58:51,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:58:37" (2/3) ... [2022-07-13 23:58:51,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4c59eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:58:51, skipping insertion in model container [2022-07-13 23:58:51,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:58:51" (3/3) ... [2022-07-13 23:58:51,418 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-13 23:58:51,430 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:58:51,430 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:58:51,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:58:51,557 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@7e6555b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@795930f7 [2022-07-13 23:58:51,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:58:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 3812 states, 3098 states have (on average 1.554228534538412) internal successors, (4815), 3121 states have internal predecessors, (4815), 600 states have call successors, (600), 113 states have call predecessors, (600), 112 states have return successors, (591), 590 states have call predecessors, (591), 591 states have call successors, (591) [2022-07-13 23:58:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 23:58:51,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:51,601 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:58:51,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:51,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -113660622, now seen corresponding path program 1 times [2022-07-13 23:58:51,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:51,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675694299] [2022-07-13 23:58:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:51,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:58:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:58:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:58:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:58:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:58:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:58:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:58:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:58:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:58:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:58:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 23:58:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:58:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:58:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:58:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-13 23:58:52,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:52,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675694299] [2022-07-13 23:58:52,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675694299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:52,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:52,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:58:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963501272] [2022-07-13 23:58:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:52,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:58:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:58:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:58:52,574 INFO L87 Difference]: Start difference. First operand has 3812 states, 3098 states have (on average 1.554228534538412) internal successors, (4815), 3121 states have internal predecessors, (4815), 600 states have call successors, (600), 113 states have call predecessors, (600), 112 states have return successors, (591), 590 states have call predecessors, (591), 591 states have call successors, (591) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 23:58:57,576 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-13 23:59:02,151 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-13 23:59:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:02,334 INFO L93 Difference]: Finished difference Result 7835 states and 12526 transitions. [2022-07-13 23:59:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:59:02,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2022-07-13 23:59:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:02,394 INFO L225 Difference]: With dead ends: 7835 [2022-07-13 23:59:02,395 INFO L226 Difference]: Without dead ends: 4002 [2022-07-13 23:59:02,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-13 23:59:02,423 INFO L413 NwaCegarLoop]: 5816 mSDtfsCounter, 6299 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 980 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6701 SdHoareTripleChecker+Valid, 9406 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:02,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6701 Valid, 9406 Invalid, 2343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [980 Valid, 1361 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2022-07-13 23:59:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-13 23:59:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3788. [2022-07-13 23:59:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3085 states have (on average 1.5319286871961102) internal successors, (4726), 3097 states have internal predecessors, (4726), 591 states have call successors, (591), 112 states have call predecessors, (591), 111 states have return successors, (589), 588 states have call predecessors, (589), 589 states have call successors, (589) [2022-07-13 23:59:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5906 transitions. [2022-07-13 23:59:02,647 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5906 transitions. Word has length 106 [2022-07-13 23:59:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:02,648 INFO L495 AbstractCegarLoop]: Abstraction has 3788 states and 5906 transitions. [2022-07-13 23:59:02,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 23:59:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5906 transitions. [2022-07-13 23:59:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 23:59:02,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:02,652 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:59:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:59:02,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 249698647, now seen corresponding path program 1 times [2022-07-13 23:59:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:02,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358245151] [2022-07-13 23:59:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:02,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:59:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:02,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:59:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:59:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:59:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:59:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:59:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:59:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:59:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 23:59:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:59:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:59:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:59:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-13 23:59:03,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:03,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358245151] [2022-07-13 23:59:03,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358245151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:03,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:03,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:59:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051852591] [2022-07-13 23:59:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:03,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:59:03,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:03,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:59:03,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:59:03,093 INFO L87 Difference]: Start difference. First operand 3788 states and 5906 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 23:59:13,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-13 23:59:14,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:59:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:15,023 INFO L93 Difference]: Finished difference Result 11728 states and 18438 transitions. [2022-07-13 23:59:15,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:59:15,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2022-07-13 23:59:15,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:15,078 INFO L225 Difference]: With dead ends: 11728 [2022-07-13 23:59:15,078 INFO L226 Difference]: Without dead ends: 7949 [2022-07-13 23:59:15,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-13 23:59:15,102 INFO L413 NwaCegarLoop]: 6355 mSDtfsCounter, 7007 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 2949 mSolverCounterSat, 1607 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7464 SdHoareTripleChecker+Valid, 14987 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 2949 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:15,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7464 Valid, 14987 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 2949 Invalid, 1 Unknown, 0 Unchecked, 11.5s Time] [2022-07-13 23:59:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2022-07-13 23:59:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7578. [2022-07-13 23:59:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 6181 states have (on average 1.5337324057595858) internal successors, (9480), 6205 states have internal predecessors, (9480), 1165 states have call successors, (1165), 223 states have call predecessors, (1165), 231 states have return successors, (1229), 1169 states have call predecessors, (1229), 1162 states have call successors, (1229) [2022-07-13 23:59:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11874 transitions. [2022-07-13 23:59:15,419 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11874 transitions. Word has length 108 [2022-07-13 23:59:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:15,419 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 11874 transitions. [2022-07-13 23:59:15,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-13 23:59:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11874 transitions. [2022-07-13 23:59:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-13 23:59:15,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:15,426 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:15,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:59:15,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1851708862, now seen corresponding path program 1 times [2022-07-13 23:59:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233339582] [2022-07-13 23:59:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:59:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:59:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:59:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:59:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:59:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:59:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:59:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:59:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 23:59:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:59:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:59:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:59:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 23:59:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:59:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 23:59:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:59:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-13 23:59:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233339582] [2022-07-13 23:59:15,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233339582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:15,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:15,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:59:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254204620] [2022-07-13 23:59:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:15,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:59:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:59:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:59:15,782 INFO L87 Difference]: Start difference. First operand 7578 states and 11874 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 23:59:21,176 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-13 23:59:25,766 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-13 23:59:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:25,949 INFO L93 Difference]: Finished difference Result 16967 states and 26412 transitions. [2022-07-13 23:59:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:59:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2022-07-13 23:59:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:26,006 INFO L225 Difference]: With dead ends: 16967 [2022-07-13 23:59:26,007 INFO L226 Difference]: Without dead ends: 9416 [2022-07-13 23:59:26,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-13 23:59:26,039 INFO L413 NwaCegarLoop]: 5970 mSDtfsCounter, 1942 mSDsluCounter, 8491 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 886 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 14461 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:26,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 14461 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 2521 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2022-07-13 23:59:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2022-07-13 23:59:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 8930. [2022-07-13 23:59:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 7210 states have (on average 1.510124826629681) internal successors, (10888), 7241 states have internal predecessors, (10888), 1416 states have call successors, (1416), 296 states have call predecessors, (1416), 303 states have return successors, (1479), 1416 states have call predecessors, (1479), 1412 states have call successors, (1479) [2022-07-13 23:59:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 13783 transitions. [2022-07-13 23:59:26,381 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 13783 transitions. Word has length 151 [2022-07-13 23:59:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:26,382 INFO L495 AbstractCegarLoop]: Abstraction has 8930 states and 13783 transitions. [2022-07-13 23:59:26,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 23:59:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 13783 transitions. [2022-07-13 23:59:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 23:59:26,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:26,390 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:59:26,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash 769983256, now seen corresponding path program 1 times [2022-07-13 23:59:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:26,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304670109] [2022-07-13 23:59:26,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:26,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:59:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:59:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:59:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:59:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:59:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:59:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:59:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:59:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 23:59:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:59:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:59:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:59:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:59:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 23:59:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 23:59:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 23:59:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 23:59:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 23:59:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-13 23:59:26,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:26,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304670109] [2022-07-13 23:59:26,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304670109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:26,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:26,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:59:26,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988918070] [2022-07-13 23:59:26,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:26,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:59:26,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:59:26,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:59:26,780 INFO L87 Difference]: Start difference. First operand 8930 states and 13783 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 23:59:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:33,801 INFO L93 Difference]: Finished difference Result 27721 states and 42979 transitions. [2022-07-13 23:59:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:59:33,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2022-07-13 23:59:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:33,992 INFO L225 Difference]: With dead ends: 27721 [2022-07-13 23:59:33,993 INFO L226 Difference]: Without dead ends: 18816 [2022-07-13 23:59:34,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:59:34,023 INFO L413 NwaCegarLoop]: 6205 mSDtfsCounter, 10427 mSDsluCounter, 8666 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 4561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10955 SdHoareTripleChecker+Valid, 14871 SdHoareTripleChecker+Invalid, 7597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4561 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:34,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10955 Valid, 14871 Invalid, 7597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4561 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-13 23:59:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18816 states. [2022-07-13 23:59:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18816 to 17319. [2022-07-13 23:59:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17319 states, 14066 states have (on average 1.5177733541874023) internal successors, (21349), 14119 states have internal predecessors, (21349), 2672 states have call successors, (2672), 561 states have call predecessors, (2672), 580 states have return successors, (2819), 2682 states have call predecessors, (2819), 2668 states have call successors, (2819) [2022-07-13 23:59:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17319 states to 17319 states and 26840 transitions. [2022-07-13 23:59:34,655 INFO L78 Accepts]: Start accepts. Automaton has 17319 states and 26840 transitions. Word has length 157 [2022-07-13 23:59:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:34,657 INFO L495 AbstractCegarLoop]: Abstraction has 17319 states and 26840 transitions. [2022-07-13 23:59:34,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-13 23:59:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 17319 states and 26840 transitions. [2022-07-13 23:59:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-13 23:59:34,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:34,666 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:34,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:59:34,667 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -937695385, now seen corresponding path program 1 times [2022-07-13 23:59:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:34,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609560487] [2022-07-13 23:59:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:59:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:59:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:59:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:59:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:59:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:59:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:59:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:59:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 23:59:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:59:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:59:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:34,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:59:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 23:59:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 23:59:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:59:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:59:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 23:59:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 23:59:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 23:59:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-07-13 23:59:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609560487] [2022-07-13 23:59:35,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609560487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:35,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:35,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:59:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626460626] [2022-07-13 23:59:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:35,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:59:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:35,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:59:35,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:59:35,055 INFO L87 Difference]: Start difference. First operand 17319 states and 26840 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-13 23:59:39,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:59:43,513 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-13 23:59:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:43,718 INFO L93 Difference]: Finished difference Result 28028 states and 43168 transitions. [2022-07-13 23:59:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:59:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2022-07-13 23:59:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:43,769 INFO L225 Difference]: With dead ends: 28028 [2022-07-13 23:59:43,769 INFO L226 Difference]: Without dead ends: 10740 [2022-07-13 23:59:43,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-13 23:59:43,812 INFO L413 NwaCegarLoop]: 5749 mSDtfsCounter, 6315 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 983 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6732 SdHoareTripleChecker+Valid, 9321 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:43,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6732 Valid, 9321 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 1352 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-07-13 23:59:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2022-07-13 23:59:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10086. [2022-07-13 23:59:44,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10086 states, 8081 states have (on average 1.4892958792228685) internal successors, (12035), 8117 states have internal predecessors, (12035), 1620 states have call successors, (1620), 376 states have call predecessors, (1620), 384 states have return successors, (1690), 1620 states have call predecessors, (1690), 1616 states have call successors, (1690) [2022-07-13 23:59:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 15345 transitions. [2022-07-13 23:59:44,183 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 15345 transitions. Word has length 191 [2022-07-13 23:59:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:44,184 INFO L495 AbstractCegarLoop]: Abstraction has 10086 states and 15345 transitions. [2022-07-13 23:59:44,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-13 23:59:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 15345 transitions. [2022-07-13 23:59:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-13 23:59:44,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:44,195 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:44,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 23:59:44,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1170401307, now seen corresponding path program 1 times [2022-07-13 23:59:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:44,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636485005] [2022-07-13 23:59:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:59:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-13 23:59:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 23:59:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:59:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:59:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:59:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:59:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:59:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 23:59:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:59:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 23:59:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:59:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:59:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:59:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 23:59:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:59:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 23:59:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:59:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:59:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:59:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:59:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:59:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 23:59:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 23:59:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 23:59:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 23:59:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 23:59:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-13 23:59:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-13 23:59:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-07-13 23:59:44,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:44,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636485005] [2022-07-13 23:59:44,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636485005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:44,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:44,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:59:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398833515] [2022-07-13 23:59:44,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:44,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:59:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:59:44,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:59:44,665 INFO L87 Difference]: Start difference. First operand 10086 states and 15345 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-13 23:59:52,976 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-13 23:59:55,006 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-14 00:00:01,591 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-14 00:00:03,622 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-14 00:00:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:00:04,012 INFO L93 Difference]: Finished difference Result 20724 states and 31634 transitions. [2022-07-14 00:00:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:00:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 234 [2022-07-14 00:00:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:00:04,067 INFO L225 Difference]: With dead ends: 20724 [2022-07-14 00:00:04,067 INFO L226 Difference]: Without dead ends: 11190 [2022-07-14 00:00:04,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:00:04,099 INFO L413 NwaCegarLoop]: 5718 mSDtfsCounter, 1012 mSDsluCounter, 18913 mSDsCounter, 0 mSdLazyCounter, 7440 mSolverCounterSat, 690 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 24631 SdHoareTripleChecker+Invalid, 8134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 7440 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:00:04,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 24631 Invalid, 8134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 7440 Invalid, 4 Unknown, 0 Unchecked, 18.9s Time] [2022-07-14 00:00:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2022-07-14 00:00:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10077. [2022-07-14 00:00:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10077 states, 8074 states have (on average 1.4892246717859796) internal successors, (12024), 8110 states have internal predecessors, (12024), 1619 states have call successors, (1619), 375 states have call predecessors, (1619), 383 states have return successors, (1689), 1619 states have call predecessors, (1689), 1615 states have call successors, (1689) [2022-07-14 00:00:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 15332 transitions. [2022-07-14 00:00:04,468 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 15332 transitions. Word has length 234 [2022-07-14 00:00:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:00:04,469 INFO L495 AbstractCegarLoop]: Abstraction has 10077 states and 15332 transitions. [2022-07-14 00:00:04,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-14 00:00:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 15332 transitions. [2022-07-14 00:00:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-14 00:00:04,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:00:04,477 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:00:04,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:00:04,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:00:04,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:00:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash 169165785, now seen corresponding path program 1 times [2022-07-14 00:00:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:00:04,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655181612] [2022-07-14 00:00:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:00:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:00:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:00:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:00:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:00:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:00:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:00:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:00:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:00:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:00:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:00:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:00:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:00:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:00:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:00:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:00:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:00:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:04,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:00:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-14 00:00:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 00:00:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-14 00:00:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-14 00:00:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 00:00:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-14 00:00:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 00:00:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:00:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 00:00:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-07-14 00:00:05,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:00:05,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655181612] [2022-07-14 00:00:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655181612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:00:05,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:00:05,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:00:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138809160] [2022-07-14 00:00:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:00:05,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:00:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:00:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:00:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:00:05,167 INFO L87 Difference]: Start difference. First operand 10077 states and 15332 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-14 00:00:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:00:13,112 INFO L93 Difference]: Finished difference Result 20201 states and 31043 transitions. [2022-07-14 00:00:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:00:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 249 [2022-07-14 00:00:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:00:13,246 INFO L225 Difference]: With dead ends: 20201 [2022-07-14 00:00:13,247 INFO L226 Difference]: Without dead ends: 10685 [2022-07-14 00:00:13,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:00:13,326 INFO L413 NwaCegarLoop]: 5835 mSDtfsCounter, 8413 mSDsluCounter, 12170 mSDsCounter, 0 mSdLazyCounter, 3900 mSolverCounterSat, 2726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8907 SdHoareTripleChecker+Valid, 18005 SdHoareTripleChecker+Invalid, 6626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2726 IncrementalHoareTripleChecker+Valid, 3900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:00:13,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8907 Valid, 18005 Invalid, 6626 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2726 Valid, 3900 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-14 00:00:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10685 states. [2022-07-14 00:00:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10685 to 9427. [2022-07-14 00:00:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9427 states, 7607 states have (on average 1.5028263441566978) internal successors, (11432), 7638 states have internal predecessors, (11432), 1483 states have call successors, (1483), 327 states have call predecessors, (1483), 336 states have return successors, (1556), 1485 states have call predecessors, (1556), 1479 states have call successors, (1556) [2022-07-14 00:00:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 14471 transitions. [2022-07-14 00:00:14,002 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 14471 transitions. Word has length 249 [2022-07-14 00:00:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:00:14,003 INFO L495 AbstractCegarLoop]: Abstraction has 9427 states and 14471 transitions. [2022-07-14 00:00:14,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-14 00:00:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 14471 transitions. [2022-07-14 00:00:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-14 00:00:14,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:00:14,017 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:00:14,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:00:14,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:00:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:00:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1271706461, now seen corresponding path program 1 times [2022-07-14 00:00:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:00:14,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440512723] [2022-07-14 00:00:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:00:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:00:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:00:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:00:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:00:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:00:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:00:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:00:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:00:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:00:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:00:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:00:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:00:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:00:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:00:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:00:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:00:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:00:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:00:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:00:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:00:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:00:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:00:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 00:00:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:00:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-14 00:00:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-14 00:00:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-14 00:00:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-14 00:00:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:00:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-14 00:00:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-07-14 00:00:14,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:00:14,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440512723] [2022-07-14 00:00:14,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440512723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:00:14,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:00:14,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:00:14,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218815348] [2022-07-14 00:00:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:00:14,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:00:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:00:14,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:00:14,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:00:14,636 INFO L87 Difference]: Start difference. First operand 9427 states and 14471 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-14 00:00:21,604 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-14 00:00:27,294 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-14 00:00:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:00:27,877 INFO L93 Difference]: Finished difference Result 21600 states and 32975 transitions. [2022-07-14 00:00:27,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:00:27,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 273 [2022-07-14 00:00:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:00:28,004 INFO L225 Difference]: With dead ends: 21600 [2022-07-14 00:00:28,004 INFO L226 Difference]: Without dead ends: 12734 [2022-07-14 00:00:28,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:00:28,051 INFO L413 NwaCegarLoop]: 6506 mSDtfsCounter, 2618 mSDsluCounter, 12797 mSDsCounter, 0 mSdLazyCounter, 3781 mSolverCounterSat, 1136 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 19303 SdHoareTripleChecker+Invalid, 4919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 3781 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:00:28,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 19303 Invalid, 4919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 3781 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2022-07-14 00:00:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12734 states. [2022-07-14 00:00:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12734 to 11694. [2022-07-14 00:00:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11694 states, 9306 states have (on average 1.478508489146787) internal successors, (13759), 9348 states have internal predecessors, (13759), 1913 states have call successors, (1913), 465 states have call predecessors, (1913), 474 states have return successors, (1987), 1912 states have call predecessors, (1987), 1908 states have call successors, (1987) [2022-07-14 00:00:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 17659 transitions. [2022-07-14 00:00:28,598 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 17659 transitions. Word has length 273 [2022-07-14 00:00:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:00:28,599 INFO L495 AbstractCegarLoop]: Abstraction has 11694 states and 17659 transitions. [2022-07-14 00:00:28,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-14 00:00:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 17659 transitions. [2022-07-14 00:00:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-14 00:00:28,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:00:28,622 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:00:28,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:00:28,622 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:00:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:00:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash 78876558, now seen corresponding path program 1 times [2022-07-14 00:00:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:00:28,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108458819] [2022-07-14 00:00:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:00:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:00:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:00:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:00:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:00:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:00:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:00:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:00:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:00:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:00:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:00:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:00:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:00:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:00:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:00:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:00:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:00:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:00:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:00:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:00:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:00:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:00:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:00:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 00:00:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:00:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-14 00:00:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-14 00:00:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:00:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-14 00:00:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:00:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-14 00:00:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-14 00:00:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:00:29,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108458819] [2022-07-14 00:00:29,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108458819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:00:29,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:00:29,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:00:29,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226393963] [2022-07-14 00:00:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:00:29,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:00:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:00:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:00:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:00:29,528 INFO L87 Difference]: Start difference. First operand 11694 states and 17659 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-14 00:00:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:00:42,906 INFO L93 Difference]: Finished difference Result 18810 states and 28593 transitions. [2022-07-14 00:00:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:00:42,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 277 [2022-07-14 00:00:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:00:42,991 INFO L225 Difference]: With dead ends: 18810 [2022-07-14 00:00:42,991 INFO L226 Difference]: Without dead ends: 18807 [2022-07-14 00:00:43,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:00:43,005 INFO L413 NwaCegarLoop]: 11786 mSDtfsCounter, 15929 mSDsluCounter, 16680 mSDsCounter, 0 mSdLazyCounter, 7150 mSolverCounterSat, 5002 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16770 SdHoareTripleChecker+Valid, 28466 SdHoareTripleChecker+Invalid, 12152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5002 IncrementalHoareTripleChecker+Valid, 7150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:00:43,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16770 Valid, 28466 Invalid, 12152 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5002 Valid, 7150 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-07-14 00:00:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2022-07-14 00:00:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 17370. [2022-07-14 00:00:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17370 states, 13821 states have (on average 1.4789089067361263) internal successors, (20440), 13890 states have internal predecessors, (20440), 2835 states have call successors, (2835), 682 states have call predecessors, (2835), 713 states have return successors, (3071), 2842 states have call predecessors, (3071), 2830 states have call successors, (3071) [2022-07-14 00:00:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 26346 transitions. [2022-07-14 00:00:43,785 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 26346 transitions. Word has length 277 [2022-07-14 00:00:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:00:43,786 INFO L495 AbstractCegarLoop]: Abstraction has 17370 states and 26346 transitions. [2022-07-14 00:00:43,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-14 00:00:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 26346 transitions. [2022-07-14 00:00:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-14 00:00:43,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:00:43,804 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:00:43,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:00:43,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:00:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:00:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1509471344, now seen corresponding path program 1 times [2022-07-14 00:00:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:00:43,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800094992] [2022-07-14 00:00:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:00:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:00:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:00:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:00:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:00:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:00:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:00:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:00:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:00:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:00:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:00:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:00:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:00:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:00:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:00:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:00:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:00:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:00:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:00:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:00:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:00:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:00:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:00:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 00:00:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:00:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-14 00:00:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-14 00:00:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:00:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-14 00:00:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:44,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:00:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:45,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:00:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:00:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-14 00:00:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2022-07-14 00:00:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:00:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800094992] [2022-07-14 00:00:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800094992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:00:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511816192] [2022-07-14 00:00:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:00:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:00:45,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:00:45,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 00:00:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:46,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 4904 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 00:00:46,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:00:46,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-14 00:00:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-14 00:00:46,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:00:46,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511816192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:00:46,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:00:46,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-14 00:00:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431564087] [2022-07-14 00:00:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:00:46,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:00:46,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:00:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:00:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:00:46,768 INFO L87 Difference]: Start difference. First operand 17370 states and 26346 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-14 00:00:51,395 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:53,421 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-14 00:00:58,185 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-14 00:01:00,220 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-14 00:01:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:00,516 INFO L93 Difference]: Finished difference Result 34371 states and 52374 transitions. [2022-07-14 00:01:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:01:00,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 277 [2022-07-14 00:01:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:00,627 INFO L225 Difference]: With dead ends: 34371 [2022-07-14 00:01:00,640 INFO L226 Difference]: Without dead ends: 17562 [2022-07-14 00:01:00,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-14 00:01:00,713 INFO L413 NwaCegarLoop]: 5818 mSDtfsCounter, 26 mSDsluCounter, 16529 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22347 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:00,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22347 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 952 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2022-07-14 00:01:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17562 states. [2022-07-14 00:01:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17562 to 17400. [2022-07-14 00:01:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17400 states, 13851 states have (on average 1.4783048155367844) internal successors, (20476), 13920 states have internal predecessors, (20476), 2835 states have call successors, (2835), 682 states have call predecessors, (2835), 713 states have return successors, (3071), 2842 states have call predecessors, (3071), 2830 states have call successors, (3071) [2022-07-14 00:01:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 26382 transitions. [2022-07-14 00:01:01,690 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 26382 transitions. Word has length 277 [2022-07-14 00:01:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:01,690 INFO L495 AbstractCegarLoop]: Abstraction has 17400 states and 26382 transitions. [2022-07-14 00:01:01,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-14 00:01:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 26382 transitions. [2022-07-14 00:01:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-14 00:01:01,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:01,702 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:01,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 00:01:01,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-14 00:01:01,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash -459269918, now seen corresponding path program 1 times [2022-07-14 00:01:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:01,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670633591] [2022-07-14 00:01:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:01:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:01:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:01:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:01:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:01:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:01:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:01:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:01:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:01:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:01:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:01:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:01:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:01:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:01:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:01:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:01:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:01:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:01:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:01:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:01:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:01:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:01:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:01:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 00:01:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:01:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-14 00:01:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-14 00:01:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:01:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-14 00:01:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:01:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:01:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-14 00:01:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-14 00:01:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-14 00:01:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:02,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670633591] [2022-07-14 00:01:02,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670633591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:02,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:02,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:01:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302126158] [2022-07-14 00:01:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:02,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:01:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:02,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:01:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:01:02,926 INFO L87 Difference]: Start difference. First operand 17400 states and 26382 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-14 00:01:12,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:20,023 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-14 00:01:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:20,910 INFO L93 Difference]: Finished difference Result 37107 states and 56836 transitions. [2022-07-14 00:01:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:01:20,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 279 [2022-07-14 00:01:20,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:21,131 INFO L225 Difference]: With dead ends: 37107 [2022-07-14 00:01:21,131 INFO L226 Difference]: Without dead ends: 20268 [2022-07-14 00:01:21,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:01:21,210 INFO L413 NwaCegarLoop]: 5398 mSDtfsCounter, 5489 mSDsluCounter, 8513 mSDsCounter, 0 mSdLazyCounter, 9007 mSolverCounterSat, 1760 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5841 SdHoareTripleChecker+Valid, 13911 SdHoareTripleChecker+Invalid, 10768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1760 IncrementalHoareTripleChecker+Valid, 9007 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:21,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5841 Valid, 13911 Invalid, 10768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1760 Valid, 9007 Invalid, 1 Unknown, 0 Unchecked, 17.2s Time] [2022-07-14 00:01:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2022-07-14 00:01:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 18512. [2022-07-14 00:01:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18512 states, 14843 states have (on average 1.4852118843899482) internal successors, (22045), 14902 states have internal predecessors, (22045), 2931 states have call successors, (2931), 682 states have call predecessors, (2931), 737 states have return successors, (3270), 2975 states have call predecessors, (3270), 2926 states have call successors, (3270) [2022-07-14 00:01:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 28246 transitions. [2022-07-14 00:01:21,924 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 28246 transitions. Word has length 279 [2022-07-14 00:01:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:21,924 INFO L495 AbstractCegarLoop]: Abstraction has 18512 states and 28246 transitions. [2022-07-14 00:01:21,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-14 00:01:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 28246 transitions. [2022-07-14 00:01:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-14 00:01:21,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:21,938 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:21,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:01:21,939 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:21,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1268616544, now seen corresponding path program 1 times [2022-07-14 00:01:21,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:21,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604757514] [2022-07-14 00:01:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:21,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:01:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:01:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:01:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:01:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:01:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:01:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:01:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:01:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:01:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:01:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:01:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:01:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:01:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:01:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:01:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:01:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:01:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:01:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:01:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:01:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:01:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:01:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:01:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 00:01:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:01:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-14 00:01:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-14 00:01:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:01:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-14 00:01:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:01:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:01:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 00:01:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-14 00:01:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-14 00:01:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-14 00:01:22,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:22,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604757514] [2022-07-14 00:01:22,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604757514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:01:22,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:01:22,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 00:01:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576840478] [2022-07-14 00:01:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:01:22,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:01:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:22,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:01:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:01:22,493 INFO L87 Difference]: Start difference. First operand 18512 states and 28246 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-14 00:01:32,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:34,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:45,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:48,545 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:56,686 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-14 00:02:17,044 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-14 00:02:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:02:22,867 INFO L93 Difference]: Finished difference Result 51859 states and 80071 transitions. [2022-07-14 00:02:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 00:02:22,867 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 279 [2022-07-14 00:02:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:02:23,004 INFO L225 Difference]: With dead ends: 51859 [2022-07-14 00:02:23,005 INFO L226 Difference]: Without dead ends: 39401 [2022-07-14 00:02:23,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-14 00:02:23,053 INFO L413 NwaCegarLoop]: 10806 mSDtfsCounter, 11320 mSDsluCounter, 37020 mSDsCounter, 0 mSdLazyCounter, 40130 mSolverCounterSat, 3634 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11850 SdHoareTripleChecker+Valid, 47826 SdHoareTripleChecker+Invalid, 43766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 3634 IncrementalHoareTripleChecker+Valid, 40130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:02:23,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11850 Valid, 47826 Invalid, 43766 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [3634 Valid, 40130 Invalid, 2 Unknown, 0 Unchecked, 57.9s Time] [2022-07-14 00:02:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2022-07-14 00:02:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 36439. [2022-07-14 00:02:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36439 states, 29238 states have (on average 1.4873452356522334) internal successors, (43487), 29355 states have internal predecessors, (43487), 5721 states have call successors, (5721), 1338 states have call predecessors, (5721), 1479 states have return successors, (6732), 5841 states have call predecessors, (6732), 5713 states have call successors, (6732) [2022-07-14 00:02:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 55940 transitions. [2022-07-14 00:02:24,331 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 55940 transitions. Word has length 279 [2022-07-14 00:02:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:02:24,332 INFO L495 AbstractCegarLoop]: Abstraction has 36439 states and 55940 transitions. [2022-07-14 00:02:24,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-14 00:02:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 55940 transitions. [2022-07-14 00:02:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-14 00:02:24,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:02:24,344 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:02:24,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:02:24,344 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:02:24,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:02:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash 634260467, now seen corresponding path program 1 times [2022-07-14 00:02:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:02:24,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010768384] [2022-07-14 00:02:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:02:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:02:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:02:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 00:02:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 00:02:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 00:02:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:02:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:02:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 00:02:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:02:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:02:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:24,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:02:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:02:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:02:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 00:02:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 00:02:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-14 00:02:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:02:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 00:02:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:02:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:02:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:02:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-14 00:02:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:02:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 00:02:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-14 00:02:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:02:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-14 00:02:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-14 00:02:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-14 00:02:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-14 00:02:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:02:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:02:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-14 00:02:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:02:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-14 00:02:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 00:02:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2022-07-14 00:02:25,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:02:25,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010768384] [2022-07-14 00:02:25,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010768384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:02:25,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327348794] [2022-07-14 00:02:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:02:25,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:02:25,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:02:25,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:02:25,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:02:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:02:26,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 5094 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 00:02:26,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:02:26,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:26,974 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 00:02:26,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2022-07-14 00:02:26,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:26,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:27,015 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 00:02:27,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2022-07-14 00:02:28,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:28,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:02:28,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:28,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-14 00:02:28,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:28,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-14 00:02:28,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:02:28,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-14 00:02:29,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-07-14 00:02:29,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-07-14 00:02:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 3 proven. 591 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-07-14 00:02:29,928 INFO L328 TraceCheckSpWp]: Computing backward predicates...