./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:34:30,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:34:30,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:34:30,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:34:30,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:34:30,333 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:34:30,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:34:30,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:34:30,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:34:30,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:34:30,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:34:30,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:34:30,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:34:30,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:34:30,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:34:30,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:34:30,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:34:30,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:34:30,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:34:30,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:34:30,361 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:34:30,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:34:30,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:34:30,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:34:30,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:34:30,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:34:30,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:34:30,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:34:30,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:34:30,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:34:30,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:34:30,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:34:30,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:34:30,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:34:30,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:34:30,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:34:30,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:34:30,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:34:30,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:34:30,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:34:30,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:34:30,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:34:30,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:34:30,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:34:30,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:34:30,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:34:30,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:34:30,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:34:30,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:34:30,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:34:30,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:34:30,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:34:30,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:34:30,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:34:30,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:34:30,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:34:30,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:34:30,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:34:30,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:34:30,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:34:30,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:34:30,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:34:30,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:34:30,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:34:30,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:34:30,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:34:30,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:34:30,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:34:30,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:34:30,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:34:30,408 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:34:30,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:34:30,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:34:30,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20e4a1f568783894f17840aa5f338f3fb65a6686c2b0eb1bb7dec08049ab8d00 [2022-07-12 13:34:30,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:34:30,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:34:30,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:34:30,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:34:30,642 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:34:30,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-12 13:34:30,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dfc53ea/5a31092bc8ef41aabe74288b09b0ee9a/FLAG21a927cd3 [2022-07-12 13:34:31,304 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:34:31,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-12 13:34:31,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dfc53ea/5a31092bc8ef41aabe74288b09b0ee9a/FLAG21a927cd3 [2022-07-12 13:34:31,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5dfc53ea/5a31092bc8ef41aabe74288b09b0ee9a [2022-07-12 13:34:31,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:34:31,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:34:31,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:34:31,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:34:31,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:34:31,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:34:31" (1/1) ... [2022-07-12 13:34:31,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23192be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:31, skipping insertion in model container [2022-07-12 13:34:31,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:34:31" (1/1) ... [2022-07-12 13:34:31,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:34:31,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:34:32,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2022-07-12 13:34:32,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:34:32,545 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:34:32,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i[175998,176011] [2022-07-12 13:34:32,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:34:32,875 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:34:32,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32 WrapperNode [2022-07-12 13:34:32,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:34:32,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:34:32,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:34:32,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:34:32,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:32,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,055 INFO L137 Inliner]: procedures = 199, calls = 2183, calls flagged for inlining = 73, calls inlined = 51, statements flattened = 3134 [2022-07-12 13:34:33,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:34:33,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:34:33,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:34:33,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:34:33,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:34:33,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:34:33,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:34:33,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:34:33,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (1/1) ... [2022-07-12 13:34:33,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:34:33,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:34:33,256 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-12 13:34:33,292 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-12 13:34:33,313 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 13:34:33,313 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 13:34:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2022-07-12 13:34:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2022-07-12 13:34:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 13:34:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:34:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:34:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 13:34:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 13:34:33,314 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 13:34:33,314 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 13:34:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:34:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:34:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-12 13:34:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-12 13:34:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 13:34:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 13:34:33,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 13:34:33,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 13:34:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-12 13:34:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-12 13:34:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:34:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:34:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2022-07-12 13:34:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2022-07-12 13:34:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 13:34:33,316 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 13:34:33,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:34:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:34:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 13:34:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 13:34:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:34:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:34:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-12 13:34:33,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-12 13:34:33,317 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-12 13:34:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-12 13:34:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2022-07-12 13:34:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2022-07-12 13:34:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 13:34:33,318 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 13:34:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:34:33,318 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2022-07-12 13:34:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2022-07-12 13:34:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2022-07-12 13:34:33,319 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2022-07-12 13:34:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:34:33,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 13:34:33,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 13:34:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 13:34:33,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 13:34:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:34:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-07-12 13:34:33,320 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-07-12 13:34:33,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:34:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2022-07-12 13:34:33,321 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2022-07-12 13:34:33,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 13:34:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2022-07-12 13:34:33,322 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2022-07-12 13:34:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 13:34:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2022-07-12 13:34:33,322 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2022-07-12 13:34:33,322 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2022-07-12 13:34:33,323 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2022-07-12 13:34:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2022-07-12 13:34:33,323 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2022-07-12 13:34:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-12 13:34:33,323 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-12 13:34:33,323 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-12 13:34:33,323 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-12 13:34:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:34:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-12 13:34:33,324 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-12 13:34:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:34:33,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:34:33,324 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 13:34:33,325 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 13:34:33,743 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:34:33,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:34:42,018 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:34:42,742 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:34:42,750 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:34:42,750 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:34:42,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:34:42 BoogieIcfgContainer [2022-07-12 13:34:42,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:34:42,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:34:42,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:34:42,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:34:42,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:34:31" (1/3) ... [2022-07-12 13:34:42,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2677feac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:34:42, skipping insertion in model container [2022-07-12 13:34:42,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:34:32" (2/3) ... [2022-07-12 13:34:42,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2677feac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:34:42, skipping insertion in model container [2022-07-12 13:34:42,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:34:42" (3/3) ... [2022-07-12 13:34:42,758 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-12 13:34:42,767 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:34:42,767 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:34:42,831 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:34:42,836 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@5e6ea35a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@148c3583 [2022-07-12 13:34:42,837 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:34:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 751 states, 578 states have (on average 1.4792387543252594) internal successors, (855), 592 states have internal predecessors, (855), 140 states have call successors, (140), 32 states have call predecessors, (140), 31 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2022-07-12 13:34:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 13:34:42,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:34:42,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:34:42,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:34:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:34:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash 392482652, now seen corresponding path program 1 times [2022-07-12 13:34:42,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:34:42,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708392759] [2022-07-12 13:34:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:34:42,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:34:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:43,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:34:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:34:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:34:43,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708392759] [2022-07-12 13:34:43,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708392759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:34:43,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:34:43,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:34:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804001947] [2022-07-12 13:34:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:34:43,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:34:43,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:34:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:34:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:34:43,398 INFO L87 Difference]: Start difference. First operand has 751 states, 578 states have (on average 1.4792387543252594) internal successors, (855), 592 states have internal predecessors, (855), 140 states have call successors, (140), 32 states have call predecessors, (140), 31 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:34:43,654 INFO L93 Difference]: Finished difference Result 2181 states and 3329 transitions. [2022-07-12 13:34:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:34:43,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-12 13:34:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:34:43,702 INFO L225 Difference]: With dead ends: 2181 [2022-07-12 13:34:43,703 INFO L226 Difference]: Without dead ends: 1419 [2022-07-12 13:34:43,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:34:43,713 INFO L413 NwaCegarLoop]: 1253 mSDtfsCounter, 1087 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:34:43,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 2303 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:34:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-07-12 13:34:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1415. [2022-07-12 13:34:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1096 states have (on average 1.4753649635036497) internal successors, (1617), 1108 states have internal predecessors, (1617), 258 states have call successors, (258), 61 states have call predecessors, (258), 60 states have return successors, (253), 253 states have call predecessors, (253), 253 states have call successors, (253) [2022-07-12 13:34:43,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2128 transitions. [2022-07-12 13:34:43,821 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2128 transitions. Word has length 21 [2022-07-12 13:34:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:34:43,822 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 2128 transitions. [2022-07-12 13:34:43,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2128 transitions. [2022-07-12 13:34:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 13:34:43,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:34:43,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:34:43,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:34:43,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:34:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:34:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1015935201, now seen corresponding path program 1 times [2022-07-12 13:34:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:34:43,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000524865] [2022-07-12 13:34:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:34:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:34:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 13:34:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:34:43,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:34:43,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000524865] [2022-07-12 13:34:43,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000524865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:34:43,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:34:43,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 13:34:43,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811220138] [2022-07-12 13:34:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:34:43,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 13:34:43,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:34:43,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 13:34:43,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:34:43,980 INFO L87 Difference]: Start difference. First operand 1415 states and 2128 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:34:44,128 INFO L93 Difference]: Finished difference Result 3978 states and 5978 transitions. [2022-07-12 13:34:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 13:34:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-12 13:34:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:34:44,183 INFO L225 Difference]: With dead ends: 3978 [2022-07-12 13:34:44,183 INFO L226 Difference]: Without dead ends: 2566 [2022-07-12 13:34:44,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 13:34:44,188 INFO L413 NwaCegarLoop]: 1244 mSDtfsCounter, 904 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:34:44,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2288 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 13:34:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-12 13:34:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2549. [2022-07-12 13:34:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1962 states have (on average 1.4658511722731906) internal successors, (2876), 1982 states have internal predecessors, (2876), 481 states have call successors, (481), 106 states have call predecessors, (481), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-12 13:34:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3833 transitions. [2022-07-12 13:34:44,272 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3833 transitions. Word has length 24 [2022-07-12 13:34:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:34:44,272 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 3833 transitions. [2022-07-12 13:34:44,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3833 transitions. [2022-07-12 13:34:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 13:34:44,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:34:44,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:34:44,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:34:44,278 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:34:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:34:44,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2094049435, now seen corresponding path program 1 times [2022-07-12 13:34:44,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:34:44,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650296778] [2022-07-12 13:34:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:34:44,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:34:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:44,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:34:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:34:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:34:44,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650296778] [2022-07-12 13:34:44,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650296778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:34:44,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:34:44,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:34:44,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064786737] [2022-07-12 13:34:44,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:34:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:34:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:34:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:34:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:34:44,436 INFO L87 Difference]: Start difference. First operand 2549 states and 3833 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:34:45,823 INFO L93 Difference]: Finished difference Result 2559 states and 3854 transitions. [2022-07-12 13:34:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:34:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-12 13:34:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:34:45,836 INFO L225 Difference]: With dead ends: 2559 [2022-07-12 13:34:45,836 INFO L226 Difference]: Without dead ends: 2556 [2022-07-12 13:34:45,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:34:45,838 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 1064 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:34:45,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1803 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 13:34:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-12 13:34:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2548. [2022-07-12 13:34:45,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1962 states have (on average 1.4653414882772682) internal successors, (2875), 1981 states have internal predecessors, (2875), 480 states have call successors, (480), 106 states have call predecessors, (480), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-12 13:34:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3831 transitions. [2022-07-12 13:34:45,908 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3831 transitions. Word has length 25 [2022-07-12 13:34:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:34:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3831 transitions. [2022-07-12 13:34:45,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3831 transitions. [2022-07-12 13:34:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 13:34:45,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:34:45,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:34:45,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:34:45,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:34:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:34:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -491175993, now seen corresponding path program 1 times [2022-07-12 13:34:45,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:34:45,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268509508] [2022-07-12 13:34:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:34:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:34:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:34:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:46,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:34:46,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:34:46,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268509508] [2022-07-12 13:34:46,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268509508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:34:46,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:34:46,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:34:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301790476] [2022-07-12 13:34:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:34:46,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:34:46,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:34:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:34:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:34:46,054 INFO L87 Difference]: Start difference. First operand 2548 states and 3831 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:34:47,340 INFO L93 Difference]: Finished difference Result 2558 states and 3852 transitions. [2022-07-12 13:34:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:34:47,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-12 13:34:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:34:47,350 INFO L225 Difference]: With dead ends: 2558 [2022-07-12 13:34:47,350 INFO L226 Difference]: Without dead ends: 2555 [2022-07-12 13:34:47,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:34:47,351 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1061 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:34:47,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1800 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 13:34:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2022-07-12 13:34:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2547. [2022-07-12 13:34:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 1962 states have (on average 1.4648318042813455) internal successors, (2874), 1980 states have internal predecessors, (2874), 479 states have call successors, (479), 106 states have call predecessors, (479), 105 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2022-07-12 13:34:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3829 transitions. [2022-07-12 13:34:47,461 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3829 transitions. Word has length 26 [2022-07-12 13:34:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:34:47,461 INFO L495 AbstractCegarLoop]: Abstraction has 2547 states and 3829 transitions. [2022-07-12 13:34:47,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3829 transitions. [2022-07-12 13:34:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 13:34:47,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:34:47,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:34:47,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:34:47,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:34:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:34:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1953265320, now seen corresponding path program 1 times [2022-07-12 13:34:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:34:47,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298769739] [2022-07-12 13:34:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:34:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:34:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:34:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:34:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:34:47,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298769739] [2022-07-12 13:34:47,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298769739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:34:47,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:34:47,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 13:34:47,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63372835] [2022-07-12 13:34:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:34:47,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:34:47,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:34:47,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:34:47,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 13:34:47,624 INFO L87 Difference]: Start difference. First operand 2547 states and 3829 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:34:50,286 INFO L93 Difference]: Finished difference Result 7585 states and 11451 transitions. [2022-07-12 13:34:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:34:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-12 13:34:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:34:50,309 INFO L225 Difference]: With dead ends: 7585 [2022-07-12 13:34:50,310 INFO L226 Difference]: Without dead ends: 5029 [2022-07-12 13:34:50,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 13:34:50,357 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1126 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:34:50,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2805 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 13:34:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2022-07-12 13:34:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5004. [2022-07-12 13:34:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 3857 states have (on average 1.467461757842883) internal successors, (5660), 3900 states have internal predecessors, (5660), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-12 13:34:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 7548 transitions. [2022-07-12 13:34:50,475 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 7548 transitions. Word has length 27 [2022-07-12 13:34:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:34:50,475 INFO L495 AbstractCegarLoop]: Abstraction has 5004 states and 7548 transitions. [2022-07-12 13:34:50,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 13:34:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 7548 transitions. [2022-07-12 13:34:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 13:34:50,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:34:50,478 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:34:50,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:34:50,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:34:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:34:50,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1400463080, now seen corresponding path program 1 times [2022-07-12 13:34:50,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:34:50,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499119459] [2022-07-12 13:34:50,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:34:50,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:34:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:34:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 13:34:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:34:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:34:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 13:34:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 13:34:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:34:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:34:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 13:34:50,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:34:50,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499119459] [2022-07-12 13:34:50,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499119459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:34:50,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:34:50,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:34:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044761276] [2022-07-12 13:34:50,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:34:50,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:34:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:34:50,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:34:50,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:34:50,701 INFO L87 Difference]: Start difference. First operand 5004 states and 7548 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 13:34:56,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-12 13:34:58,662 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-12 13:35:00,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:35:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:35:02,460 INFO L93 Difference]: Finished difference Result 10466 states and 15931 transitions. [2022-07-12 13:35:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:35:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 77 [2022-07-12 13:35:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:35:02,491 INFO L225 Difference]: With dead ends: 10466 [2022-07-12 13:35:02,491 INFO L226 Difference]: Without dead ends: 5461 [2022-07-12 13:35:02,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:35:02,510 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 182 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 154 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:35:02,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 4860 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1295 Invalid, 3 Unknown, 0 Unchecked, 11.5s Time] [2022-07-12 13:35:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2022-07-12 13:35:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5006. [2022-07-12 13:35:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5006 states, 3859 states have (on average 1.4661829489505054) internal successors, (5658), 3902 states have internal predecessors, (5658), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-12 13:35:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7546 transitions. [2022-07-12 13:35:02,776 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7546 transitions. Word has length 77 [2022-07-12 13:35:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:35:02,777 INFO L495 AbstractCegarLoop]: Abstraction has 5006 states and 7546 transitions. [2022-07-12 13:35:02,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 13:35:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7546 transitions. [2022-07-12 13:35:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 13:35:02,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:35:02,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:35:02,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:35:02,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:35:02,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:35:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1710126176, now seen corresponding path program 1 times [2022-07-12 13:35:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:35:02,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888487566] [2022-07-12 13:35:02,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:35:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:35:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:35:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 13:35:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 13:35:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 13:35:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:35:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 13:35:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 13:35:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 13:35:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:35:03,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888487566] [2022-07-12 13:35:03,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888487566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:35:03,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:35:03,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:35:03,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636728083] [2022-07-12 13:35:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:35:03,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:35:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:35:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:35:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:35:03,064 INFO L87 Difference]: Start difference. First operand 5006 states and 7546 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 13:35:08,080 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-12 13:35:10,138 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-12 13:35:12,205 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-12 13:35:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:35:13,767 INFO L93 Difference]: Finished difference Result 11182 states and 17097 transitions. [2022-07-12 13:35:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:35:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 104 [2022-07-12 13:35:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:35:13,799 INFO L225 Difference]: With dead ends: 11182 [2022-07-12 13:35:13,800 INFO L226 Difference]: Without dead ends: 6179 [2022-07-12 13:35:13,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:35:13,815 INFO L413 NwaCegarLoop]: 1349 mSDtfsCounter, 728 mSDsluCounter, 3605 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 339 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4954 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:35:13,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4954 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1066 Invalid, 3 Unknown, 0 Unchecked, 10.5s Time] [2022-07-12 13:35:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-12 13:35:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5014. [2022-07-12 13:35:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5014 states, 3867 states have (on average 1.465218515645203) internal successors, (5666), 3910 states have internal predecessors, (5666), 949 states have call successors, (949), 205 states have call predecessors, (949), 197 states have return successors, (939), 930 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-12 13:35:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 7554 transitions. [2022-07-12 13:35:13,968 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 7554 transitions. Word has length 104 [2022-07-12 13:35:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:35:13,969 INFO L495 AbstractCegarLoop]: Abstraction has 5014 states and 7554 transitions. [2022-07-12 13:35:13,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 13:35:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 7554 transitions. [2022-07-12 13:35:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 13:35:13,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:35:13,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:35:13,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 13:35:13,973 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:35:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:35:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1744883690, now seen corresponding path program 1 times [2022-07-12 13:35:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:35:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051094586] [2022-07-12 13:35:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:35:13,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:35:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:35:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 13:35:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 13:35:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 13:35:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:35:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:35:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 13:35:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 13:35:14,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:35:14,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051094586] [2022-07-12 13:35:14,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051094586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:35:14,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:35:14,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:35:14,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062640167] [2022-07-12 13:35:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:35:14,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:35:14,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:35:14,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:35:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:35:14,214 INFO L87 Difference]: Start difference. First operand 5014 states and 7554 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 13:35:18,381 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-12 13:35:20,441 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-12 13:35:22,565 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-12 13:35:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:35:23,941 INFO L93 Difference]: Finished difference Result 10407 states and 16031 transitions. [2022-07-12 13:35:23,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:35:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2022-07-12 13:35:23,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:35:23,962 INFO L225 Difference]: With dead ends: 10407 [2022-07-12 13:35:23,962 INFO L226 Difference]: Without dead ends: 5396 [2022-07-12 13:35:23,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:35:23,985 INFO L413 NwaCegarLoop]: 1004 mSDtfsCounter, 1194 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 468 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:35:23,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 2243 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 513 Invalid, 3 Unknown, 0 Unchecked, 9.5s Time] [2022-07-12 13:35:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-07-12 13:35:24,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4990. [2022-07-12 13:35:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3851 states have (on average 1.3996364580628409) internal successors, (5390), 3894 states have internal predecessors, (5390), 941 states have call successors, (941), 205 states have call predecessors, (941), 197 states have return successors, (931), 922 states have call predecessors, (931), 931 states have call successors, (931) [2022-07-12 13:35:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 7262 transitions. [2022-07-12 13:35:24,179 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 7262 transitions. Word has length 102 [2022-07-12 13:35:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:35:24,180 INFO L495 AbstractCegarLoop]: Abstraction has 4990 states and 7262 transitions. [2022-07-12 13:35:24,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-12 13:35:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 7262 transitions. [2022-07-12 13:35:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 13:35:24,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:35:24,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:35:24,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 13:35:24,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:35:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:35:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1621242927, now seen corresponding path program 1 times [2022-07-12 13:35:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:35:24,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572233945] [2022-07-12 13:35:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:35:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:35:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:35:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 13:35:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 13:35:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 13:35:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 13:35:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:35:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 13:35:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 13:35:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 13:35:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:35:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572233945] [2022-07-12 13:35:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572233945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:35:24,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:35:24,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:35:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710935344] [2022-07-12 13:35:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:35:24,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:35:24,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:35:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:35:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:35:24,429 INFO L87 Difference]: Start difference. First operand 4990 states and 7262 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 13:35:29,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:35:32,051 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-12 13:35:34,119 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-12 13:35:36,325 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-12 13:35:38,356 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-12 13:35:40,485 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-12 13:35:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:35:42,256 INFO L93 Difference]: Finished difference Result 15758 states and 23270 transitions. [2022-07-12 13:35:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:35:42,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2022-07-12 13:35:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:35:42,344 INFO L225 Difference]: With dead ends: 15758 [2022-07-12 13:35:42,344 INFO L226 Difference]: Without dead ends: 10771 [2022-07-12 13:35:42,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:35:42,387 INFO L413 NwaCegarLoop]: 1642 mSDtfsCounter, 1264 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 549 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-07-12 13:35:42,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 4440 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1196 Invalid, 6 Unknown, 0 Unchecked, 17.5s Time] [2022-07-12 13:35:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2022-07-12 13:35:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9936. [2022-07-12 13:35:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9936 states, 7665 states have (on average 1.3993476842791912) internal successors, (10726), 7750 states have internal predecessors, (10726), 1877 states have call successors, (1877), 407 states have call predecessors, (1877), 393 states have return successors, (1861), 1842 states have call predecessors, (1861), 1861 states have call successors, (1861) [2022-07-12 13:35:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9936 states to 9936 states and 14464 transitions. [2022-07-12 13:35:42,763 INFO L78 Accepts]: Start accepts. Automaton has 9936 states and 14464 transitions. Word has length 108 [2022-07-12 13:35:42,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:35:42,763 INFO L495 AbstractCegarLoop]: Abstraction has 9936 states and 14464 transitions. [2022-07-12 13:35:42,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 13:35:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9936 states and 14464 transitions. [2022-07-12 13:35:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 13:35:42,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:35:42,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:35:42,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 13:35:42,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:35:42,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:35:42,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1012080502, now seen corresponding path program 1 times [2022-07-12 13:35:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:35:42,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207315927] [2022-07-12 13:35:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:35:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:35:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:35:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:35:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:35:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:35:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:35:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:43,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:43,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:35:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 13:35:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 13:35:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:35:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:35:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 13:35:43,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:35:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207315927] [2022-07-12 13:35:43,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207315927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:35:43,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:35:43,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:35:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289200716] [2022-07-12 13:35:43,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:35:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:35:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:35:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:35:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:35:43,027 INFO L87 Difference]: Start difference. First operand 9936 states and 14464 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 13:35:48,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:35:50,971 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-12 13:35:52,669 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-12 13:35:54,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:35:56,811 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-12 13:35:58,970 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-12 13:36:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:36:00,801 INFO L93 Difference]: Finished difference Result 25936 states and 38367 transitions. [2022-07-12 13:36:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:36:00,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2022-07-12 13:36:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:36:00,860 INFO L225 Difference]: With dead ends: 25936 [2022-07-12 13:36:00,861 INFO L226 Difference]: Without dead ends: 16003 [2022-07-12 13:36:00,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:36:00,884 INFO L413 NwaCegarLoop]: 1709 mSDtfsCounter, 1190 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 646 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 4469 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:36:00,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 4469 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 1219 Invalid, 5 Unknown, 0 Unchecked, 17.2s Time] [2022-07-12 13:36:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16003 states. [2022-07-12 13:36:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16003 to 14784. [2022-07-12 13:36:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14784 states, 11449 states have (on average 1.3945322735610097) internal successors, (15966), 11566 states have internal predecessors, (15966), 2761 states have call successors, (2761), 587 states have call predecessors, (2761), 573 states have return successors, (2745), 2726 states have call predecessors, (2745), 2745 states have call successors, (2745) [2022-07-12 13:36:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 21472 transitions. [2022-07-12 13:36:01,453 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 21472 transitions. Word has length 110 [2022-07-12 13:36:01,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:36:01,454 INFO L495 AbstractCegarLoop]: Abstraction has 14784 states and 21472 transitions. [2022-07-12 13:36:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-12 13:36:01,455 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 21472 transitions. [2022-07-12 13:36:01,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 13:36:01,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:36:01,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:36:01,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 13:36:01,460 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:36:01,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:36:01,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1582291269, now seen corresponding path program 1 times [2022-07-12 13:36:01,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:36:01,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809960397] [2022-07-12 13:36:01,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:36:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:36:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:36:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:36:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:36:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:36:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:36:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:36:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 13:36:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 13:36:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 13:36:01,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:36:01,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809960397] [2022-07-12 13:36:01,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809960397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:36:01,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:36:01,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:36:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325763088] [2022-07-12 13:36:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:36:01,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:36:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:36:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:36:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:36:01,654 INFO L87 Difference]: Start difference. First operand 14784 states and 21472 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 13:36:07,710 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-12 13:36:09,919 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-12 13:36:11,994 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-12 13:36:14,087 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-12 13:36:16,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:36:18,326 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-12 13:36:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:36:20,343 INFO L93 Difference]: Finished difference Result 36024 states and 53119 transitions. [2022-07-12 13:36:20,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:36:20,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 131 [2022-07-12 13:36:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:36:20,530 INFO L225 Difference]: With dead ends: 36024 [2022-07-12 13:36:20,531 INFO L226 Difference]: Without dead ends: 21243 [2022-07-12 13:36:20,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:36:20,565 INFO L413 NwaCegarLoop]: 1910 mSDtfsCounter, 1202 mSDsluCounter, 3084 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 613 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 4994 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:36:20,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 4994 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 1234 Invalid, 6 Unknown, 0 Unchecked, 18.1s Time] [2022-07-12 13:36:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21243 states. [2022-07-12 13:36:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21243 to 19632. [2022-07-12 13:36:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19632 states, 15233 states have (on average 1.3921092365259633) internal successors, (21206), 15382 states have internal predecessors, (21206), 3645 states have call successors, (3645), 767 states have call predecessors, (3645), 753 states have return successors, (3629), 3610 states have call predecessors, (3629), 3629 states have call successors, (3629) [2022-07-12 13:36:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19632 states to 19632 states and 28480 transitions. [2022-07-12 13:36:21,190 INFO L78 Accepts]: Start accepts. Automaton has 19632 states and 28480 transitions. Word has length 131 [2022-07-12 13:36:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:36:21,190 INFO L495 AbstractCegarLoop]: Abstraction has 19632 states and 28480 transitions. [2022-07-12 13:36:21,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 13:36:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19632 states and 28480 transitions. [2022-07-12 13:36:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 13:36:21,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:36:21,198 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:36:21,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 13:36:21,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:36:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:36:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1020367177, now seen corresponding path program 1 times [2022-07-12 13:36:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:36:21,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690254311] [2022-07-12 13:36:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:36:21,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:36:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:36:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:36:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:36:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:36:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:36:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:36:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:36:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:36:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:36:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 13:36:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:36:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:36:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 13:36:21,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:36:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690254311] [2022-07-12 13:36:21,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690254311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:36:21,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:36:21,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:36:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870718406] [2022-07-12 13:36:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:36:21,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:36:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:36:21,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:36:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:36:21,523 INFO L87 Difference]: Start difference. First operand 19632 states and 28480 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:36:29,438 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-12 13:36:31,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:36:33,495 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-12 13:36:35,521 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-12 13:36:37,647 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-12 13:36:39,675 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-12 13:36:41,701 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-12 13:36:43,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:36:45,966 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-12 13:36:47,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:36:49,539 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-12 13:36:51,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:36:54,568 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-12 13:36:56,598 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-12 13:36:58,627 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-12 13:37:01,122 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-12 13:37:03,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:37:05,990 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-12 13:37:08,016 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-12 13:37:10,044 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-12 13:37:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:37:14,042 INFO L93 Difference]: Finished difference Result 46112 states and 67871 transitions. [2022-07-12 13:37:14,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 13:37:14,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-12 13:37:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:37:14,154 INFO L225 Difference]: With dead ends: 46112 [2022-07-12 13:37:14,154 INFO L226 Difference]: Without dead ends: 26483 [2022-07-12 13:37:14,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:37:14,203 INFO L413 NwaCegarLoop]: 1734 mSDtfsCounter, 1439 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 825 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 825 IncrementalHoareTripleChecker+Valid, 4921 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.8s IncrementalHoareTripleChecker+Time [2022-07-12 13:37:14,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 3432 Invalid, 5765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [825 Valid, 4921 Invalid, 19 Unknown, 0 Unchecked, 51.8s Time] [2022-07-12 13:37:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2022-07-12 13:37:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 24480. [2022-07-12 13:37:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24480 states, 19017 states have (on average 1.3906504706315401) internal successors, (26446), 19198 states have internal predecessors, (26446), 4529 states have call successors, (4529), 947 states have call predecessors, (4529), 933 states have return successors, (4513), 4494 states have call predecessors, (4513), 4513 states have call successors, (4513) [2022-07-12 13:37:15,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35488 transitions. [2022-07-12 13:37:15,167 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35488 transitions. Word has length 152 [2022-07-12 13:37:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:37:15,167 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35488 transitions. [2022-07-12 13:37:15,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:37:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35488 transitions. [2022-07-12 13:37:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 13:37:15,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:37:15,176 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:37:15,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 13:37:15,177 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:37:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:37:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2130073905, now seen corresponding path program 1 times [2022-07-12 13:37:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:37:15,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171511853] [2022-07-12 13:37:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:37:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:37:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:37:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:37:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:37:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:37:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:37:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:37:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 13:37:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:37:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 13:37:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 13:37:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-12 13:37:15,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:37:15,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171511853] [2022-07-12 13:37:15,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171511853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:37:15,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:37:15,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 13:37:15,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542870479] [2022-07-12 13:37:15,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:37:15,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:37:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:37:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:37:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:37:15,373 INFO L87 Difference]: Start difference. First operand 24480 states and 35488 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:37:20,159 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-12 13:37:22,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:37:24,209 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-12 13:37:26,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:37:27,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:37:29,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:37:31,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:37:33,964 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-12 13:37:36,208 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-12 13:37:38,243 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-12 13:37:40,274 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-12 13:37:42,300 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-12 13:37:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:37:45,267 INFO L93 Difference]: Finished difference Result 50943 states and 74695 transitions. [2022-07-12 13:37:45,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 13:37:45,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2022-07-12 13:37:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:37:45,367 INFO L225 Difference]: With dead ends: 50943 [2022-07-12 13:37:45,367 INFO L226 Difference]: Without dead ends: 26466 [2022-07-12 13:37:45,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-07-12 13:37:45,474 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 1762 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 1090 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1090 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:37:45,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 2182 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1090 Valid, 3035 Invalid, 10 Unknown, 0 Unchecked, 29.0s Time] [2022-07-12 13:37:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2022-07-12 13:37:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 24480. [2022-07-12 13:37:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24480 states, 19017 states have (on average 1.3904401325130147) internal successors, (26442), 19198 states have internal predecessors, (26442), 4529 states have call successors, (4529), 947 states have call predecessors, (4529), 933 states have return successors, (4513), 4494 states have call predecessors, (4513), 4513 states have call successors, (4513) [2022-07-12 13:37:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35484 transitions. [2022-07-12 13:37:46,587 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35484 transitions. Word has length 153 [2022-07-12 13:37:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:37:46,588 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35484 transitions. [2022-07-12 13:37:46,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:37:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35484 transitions. [2022-07-12 13:37:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 13:37:46,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:37:46,597 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:37:46,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 13:37:46,597 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:37:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:37:46,598 INFO L85 PathProgramCache]: Analyzing trace with hash 574017791, now seen corresponding path program 1 times [2022-07-12 13:37:46,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:37:46,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314756797] [2022-07-12 13:37:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:37:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:37:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:37:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:37:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:37:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:37:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:37:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:37:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 13:37:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:37:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:37:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 13:37:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:37:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:37:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 13:37:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:37:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314756797] [2022-07-12 13:37:46,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314756797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:37:46,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:37:46,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:37:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725975387] [2022-07-12 13:37:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:37:46,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:37:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:37:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:37:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:37:46,790 INFO L87 Difference]: Start difference. First operand 24480 states and 35484 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:37:54,368 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-12 13:37:56,397 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-12 13:37:58,427 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-12 13:37:59,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:02,013 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-12 13:38:04,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:06,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:08,097 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-12 13:38:10,333 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-12 13:38:12,361 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-12 13:38:14,394 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-12 13:38:16,426 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-12 13:38:19,304 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-12 13:38:21,331 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-12 13:38:23,361 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-12 13:38:26,043 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-12 13:38:28,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:30,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:32,162 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-12 13:38:34,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:36,227 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-12 13:38:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:38:40,730 INFO L93 Difference]: Finished difference Result 56200 states and 82615 transitions. [2022-07-12 13:38:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 13:38:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-12 13:38:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:38:40,831 INFO L225 Difference]: With dead ends: 56200 [2022-07-12 13:38:40,832 INFO L226 Difference]: Without dead ends: 31723 [2022-07-12 13:38:40,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:38:40,879 INFO L413 NwaCegarLoop]: 1727 mSDtfsCounter, 1438 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 4936 mSolverCounterSat, 836 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 3385 SdHoareTripleChecker+Invalid, 5792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 4936 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:38:40,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 3385 Invalid, 5792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 4936 Invalid, 20 Unknown, 0 Unchecked, 52.9s Time] [2022-07-12 13:38:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31723 states. [2022-07-12 13:38:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31723 to 29328. [2022-07-12 13:38:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29328 states, 22801 states have (on average 1.389500460506118) internal successors, (31682), 23014 states have internal predecessors, (31682), 5413 states have call successors, (5413), 1127 states have call predecessors, (5413), 1113 states have return successors, (5397), 5378 states have call predecessors, (5397), 5397 states have call successors, (5397) [2022-07-12 13:38:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29328 states to 29328 states and 42492 transitions. [2022-07-12 13:38:42,027 INFO L78 Accepts]: Start accepts. Automaton has 29328 states and 42492 transitions. Word has length 152 [2022-07-12 13:38:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:38:42,029 INFO L495 AbstractCegarLoop]: Abstraction has 29328 states and 42492 transitions. [2022-07-12 13:38:42,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:38:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29328 states and 42492 transitions. [2022-07-12 13:38:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 13:38:42,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:38:42,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:38:42,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 13:38:42,039 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:38:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:38:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 440004285, now seen corresponding path program 1 times [2022-07-12 13:38:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:38:42,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470968555] [2022-07-12 13:38:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:38:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:38:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 13:38:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 13:38:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:38:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 13:38:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:38:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 13:38:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 13:38:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:38:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:38:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 13:38:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:38:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:38:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 13:38:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 13:38:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:38:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 13:38:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:38:42,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470968555] [2022-07-12 13:38:42,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470968555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:38:42,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:38:42,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 13:38:42,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275630127] [2022-07-12 13:38:42,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:38:42,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:38:42,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:38:42,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:38:42,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:38:42,327 INFO L87 Difference]: Start difference. First operand 29328 states and 42492 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 13:38:48,676 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-12 13:38:50,707 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-12 13:38:52,738 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-12 13:38:54,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:38:56,991 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-12 13:38:59,023 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 []