./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 791161d1 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-?-791161d [2022-07-23 00:51:07,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 00:51:07,045 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 00:51:07,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 00:51:07,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 00:51:07,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 00:51:07,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 00:51:07,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 00:51:07,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 00:51:07,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 00:51:07,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 00:51:07,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 00:51:07,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 00:51:07,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 00:51:07,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 00:51:07,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 00:51:07,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 00:51:07,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 00:51:07,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 00:51:07,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 00:51:07,131 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 00:51:07,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 00:51:07,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 00:51:07,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 00:51:07,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 00:51:07,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 00:51:07,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 00:51:07,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 00:51:07,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 00:51:07,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 00:51:07,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 00:51:07,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 00:51:07,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 00:51:07,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 00:51:07,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 00:51:07,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 00:51:07,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 00:51:07,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 00:51:07,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 00:51:07,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 00:51:07,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 00:51:07,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 00:51:07,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 00:51:07,190 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 00:51:07,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 00:51:07,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 00:51:07,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 00:51:07,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 00:51:07,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 00:51:07,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 00:51:07,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 00:51:07,193 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 00:51:07,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 00:51:07,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 00:51:07,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 00:51:07,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 00:51:07,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 00:51:07,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 00:51:07,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 00:51:07,195 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 00:51:07,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 00:51:07,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 00:51:07,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 00:51:07,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 00:51:07,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:51:07,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 00:51:07,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 00:51:07,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 00:51:07,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 00:51:07,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 00:51:07,198 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 00:51:07,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 00:51:07,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 00:51:07,198 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-23 00:51:07,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 00:51:07,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 00:51:07,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 00:51:07,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 00:51:07,500 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 00:51:07,502 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-23 00:51:07,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0940ee12f/def4bdd186f9468e8cd7112b5cadb72c/FLAG600535a88 [2022-07-23 00:51:08,348 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 00:51:08,349 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-23 00:51:08,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0940ee12f/def4bdd186f9468e8cd7112b5cadb72c/FLAG600535a88 [2022-07-23 00:51:08,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0940ee12f/def4bdd186f9468e8cd7112b5cadb72c [2022-07-23 00:51:08,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 00:51:08,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 00:51:08,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 00:51:08,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 00:51:08,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 00:51:08,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:51:08" (1/1) ... [2022-07-23 00:51:08,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d61fb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:08, skipping insertion in model container [2022-07-23 00:51:08,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:51:08" (1/1) ... [2022-07-23 00:51:08,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 00:51:08,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 00:51:10,051 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-23 00:51:10,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:51:10,239 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 00:51:10,521 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-23 00:51:10,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 00:51:10,685 INFO L208 MainTranslator]: Completed translation [2022-07-23 00:51:10,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10 WrapperNode [2022-07-23 00:51:10,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 00:51:10,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 00:51:10,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 00:51:10,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 00:51:10,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:10,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:10,892 INFO L137 Inliner]: procedures = 199, calls = 2183, calls flagged for inlining = 73, calls inlined = 51, statements flattened = 3134 [2022-07-23 00:51:10,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 00:51:10,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 00:51:10,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 00:51:10,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 00:51:10,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:10,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:10,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:10,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:11,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:11,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:11,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:11,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 00:51:11,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 00:51:11,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 00:51:11,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 00:51:11,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (1/1) ... [2022-07-23 00:51:11,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 00:51:11,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 00:51:11,153 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-23 00:51:11,177 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-23 00:51:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-23 00:51:11,199 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-23 00:51:11,199 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2022-07-23 00:51:11,200 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2022-07-23 00:51:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-23 00:51:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 00:51:11,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 00:51:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 00:51:11,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 00:51:11,200 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-23 00:51:11,201 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-23 00:51:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 00:51:11,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 00:51:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-23 00:51:11,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2022-07-23 00:51:11,201 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-23 00:51:11,201 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-23 00:51:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-23 00:51:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-23 00:51:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-23 00:51:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-23 00:51:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 00:51:11,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 00:51:11,202 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2022-07-23 00:51:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2022-07-23 00:51:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-23 00:51:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-23 00:51:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 00:51:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 00:51:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 00:51:11,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 00:51:11,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 00:51:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 00:51:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-23 00:51:11,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2022-07-23 00:51:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-23 00:51:11,204 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-23 00:51:11,204 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2022-07-23 00:51:11,204 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2022-07-23 00:51:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 00:51:11,205 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 00:51:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 00:51:11,205 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2022-07-23 00:51:11,206 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2022-07-23 00:51:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2022-07-23 00:51:11,206 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2022-07-23 00:51:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 00:51:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 00:51:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 00:51:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-23 00:51:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-23 00:51:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 00:51:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2022-07-23 00:51:11,208 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2022-07-23 00:51:11,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 00:51:11,209 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2022-07-23 00:51:11,209 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2022-07-23 00:51:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 00:51:11,210 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2022-07-23 00:51:11,210 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2022-07-23 00:51:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-23 00:51:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2022-07-23 00:51:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2022-07-23 00:51:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2022-07-23 00:51:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2022-07-23 00:51:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2022-07-23 00:51:11,212 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2022-07-23 00:51:11,212 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-23 00:51:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-23 00:51:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-23 00:51:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-23 00:51:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 00:51:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-23 00:51:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-23 00:51:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 00:51:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 00:51:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-23 00:51:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-23 00:51:11,648 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 00:51:11,650 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 00:51:20,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 00:51:21,657 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 00:51:21,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 00:51:21,674 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 00:51:21,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:51:21 BoogieIcfgContainer [2022-07-23 00:51:21,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 00:51:21,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 00:51:21,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 00:51:21,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 00:51:21,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:51:08" (1/3) ... [2022-07-23 00:51:21,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3facac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:51:21, skipping insertion in model container [2022-07-23 00:51:21,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:51:10" (2/3) ... [2022-07-23 00:51:21,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3facac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:51:21, skipping insertion in model container [2022-07-23 00:51:21,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:51:21" (3/3) ... [2022-07-23 00:51:21,688 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2022-07-23 00:51:21,703 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 00:51:21,703 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-23 00:51:21,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 00:51:21,793 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@291bfb93, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7370b70 [2022-07-23 00:51:21,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-23 00:51:21,800 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-23 00:51:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 00:51:21,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:21,812 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-23 00:51:21,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 392482652, now seen corresponding path program 1 times [2022-07-23 00:51:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:21,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248698897] [2022-07-23 00:51:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:22,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:22,413 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-23 00:51:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:22,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248698897] [2022-07-23 00:51:22,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248698897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:22,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:22,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:51:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790594590] [2022-07-23 00:51:22,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:22,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:51:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:22,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:51:22,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:51:22,456 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-23 00:51:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:22,778 INFO L93 Difference]: Finished difference Result 2181 states and 3329 transitions. [2022-07-23 00:51:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:51:22,781 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-23 00:51:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:22,809 INFO L225 Difference]: With dead ends: 2181 [2022-07-23 00:51:22,810 INFO L226 Difference]: Without dead ends: 1419 [2022-07-23 00:51:22,819 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-23 00:51:22,826 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-23 00:51:22,827 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-23 00:51:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2022-07-23 00:51:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1415. [2022-07-23 00:51:22,978 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-23 00:51:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2128 transitions. [2022-07-23 00:51:22,990 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2128 transitions. Word has length 21 [2022-07-23 00:51:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:22,991 INFO L495 AbstractCegarLoop]: Abstraction has 1415 states and 2128 transitions. [2022-07-23 00:51:22,991 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-23 00:51:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2128 transitions. [2022-07-23 00:51:22,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 00:51:23,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:23,000 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-23 00:51:23,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 00:51:23,001 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1015935201, now seen corresponding path program 1 times [2022-07-23 00:51:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:23,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129627133] [2022-07-23 00:51:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:23,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-23 00:51:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:23,247 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-23 00:51:23,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:23,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129627133] [2022-07-23 00:51:23,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129627133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:23,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:23,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 00:51:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156681312] [2022-07-23 00:51:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:23,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 00:51:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 00:51:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 00:51:23,252 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-23 00:51:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:23,517 INFO L93 Difference]: Finished difference Result 3978 states and 5978 transitions. [2022-07-23 00:51:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 00:51:23,518 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-23 00:51:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:23,538 INFO L225 Difference]: With dead ends: 3978 [2022-07-23 00:51:23,538 INFO L226 Difference]: Without dead ends: 2566 [2022-07-23 00:51:23,547 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-23 00:51:23,552 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-23 00:51:23,552 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-23 00:51:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-23 00:51:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2549. [2022-07-23 00:51:23,659 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-23 00:51:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3833 transitions. [2022-07-23 00:51:23,685 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3833 transitions. Word has length 24 [2022-07-23 00:51:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:23,686 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 3833 transitions. [2022-07-23 00:51:23,686 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-23 00:51:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3833 transitions. [2022-07-23 00:51:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 00:51:23,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:23,692 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-23 00:51:23,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 00:51:23,692 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2094049435, now seen corresponding path program 1 times [2022-07-23 00:51:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:23,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667526956] [2022-07-23 00:51:23,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:23,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:23,948 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-23 00:51:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667526956] [2022-07-23 00:51:23,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667526956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:23,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:23,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:51:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636946374] [2022-07-23 00:51:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:23,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:51:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:51:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:51:23,952 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-23 00:51:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:25,880 INFO L93 Difference]: Finished difference Result 2559 states and 3854 transitions. [2022-07-23 00:51:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:51:25,881 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-23 00:51:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:25,898 INFO L225 Difference]: With dead ends: 2559 [2022-07-23 00:51:25,898 INFO L226 Difference]: Without dead ends: 2556 [2022-07-23 00:51:25,901 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-23 00:51:25,902 INFO L413 NwaCegarLoop]: 1086 mSDtfsCounter, 1064 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 00:51:25,902 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.8s Time] [2022-07-23 00:51:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-23 00:51:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2548. [2022-07-23 00:51:25,997 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-23 00:51:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3831 transitions. [2022-07-23 00:51:26,012 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3831 transitions. Word has length 25 [2022-07-23 00:51:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:26,014 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3831 transitions. [2022-07-23 00:51:26,015 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-23 00:51:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3831 transitions. [2022-07-23 00:51:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 00:51:26,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:26,017 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-23 00:51:26,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 00:51:26,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:26,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash -491175993, now seen corresponding path program 1 times [2022-07-23 00:51:26,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:26,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648986991] [2022-07-23 00:51:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:26,214 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-23 00:51:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:26,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648986991] [2022-07-23 00:51:26,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648986991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:26,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:26,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:51:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931785026] [2022-07-23 00:51:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:26,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:51:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:51:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:51:26,219 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-23 00:51:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:27,698 INFO L93 Difference]: Finished difference Result 2558 states and 3852 transitions. [2022-07-23 00:51:27,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 00:51:27,699 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-23 00:51:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:27,715 INFO L225 Difference]: With dead ends: 2558 [2022-07-23 00:51:27,715 INFO L226 Difference]: Without dead ends: 2555 [2022-07-23 00:51:27,718 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-23 00:51:27,719 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 1061 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 00:51:27,719 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.4s Time] [2022-07-23 00:51:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2022-07-23 00:51:27,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2547. [2022-07-23 00:51:27,825 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-23 00:51:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 3829 transitions. [2022-07-23 00:51:27,839 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 3829 transitions. Word has length 26 [2022-07-23 00:51:27,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:27,840 INFO L495 AbstractCegarLoop]: Abstraction has 2547 states and 3829 transitions. [2022-07-23 00:51:27,840 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-23 00:51:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3829 transitions. [2022-07-23 00:51:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 00:51:27,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:27,841 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-23 00:51:27,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 00:51:27,842 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1953265320, now seen corresponding path program 1 times [2022-07-23 00:51:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:27,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457185312] [2022-07-23 00:51:27,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:27,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:28,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:28,029 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-23 00:51:28,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:28,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457185312] [2022-07-23 00:51:28,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457185312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:28,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:28,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 00:51:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962451846] [2022-07-23 00:51:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:28,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 00:51:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 00:51:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 00:51:28,032 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-23 00:51:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:30,871 INFO L93 Difference]: Finished difference Result 7585 states and 11451 transitions. [2022-07-23 00:51:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 00:51:30,872 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-23 00:51:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:30,904 INFO L225 Difference]: With dead ends: 7585 [2022-07-23 00:51:30,905 INFO L226 Difference]: Without dead ends: 5029 [2022-07-23 00:51:30,916 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-23 00:51:30,918 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.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:51:30,918 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.6s Time] [2022-07-23 00:51:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2022-07-23 00:51:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5004. [2022-07-23 00:51:31,109 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-23 00:51:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 7548 transitions. [2022-07-23 00:51:31,134 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 7548 transitions. Word has length 27 [2022-07-23 00:51:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:31,135 INFO L495 AbstractCegarLoop]: Abstraction has 5004 states and 7548 transitions. [2022-07-23 00:51:31,135 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-23 00:51:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 7548 transitions. [2022-07-23 00:51:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 00:51:31,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:31,142 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-23 00:51:31,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 00:51:31,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1400463080, now seen corresponding path program 1 times [2022-07-23 00:51:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:31,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358736484] [2022-07-23 00:51:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 00:51:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:51:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 00:51:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-23 00:51:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:31,424 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-23 00:51:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:31,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358736484] [2022-07-23 00:51:31,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358736484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:31,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:31,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:51:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280614341] [2022-07-23 00:51:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:31,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:51:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:31,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:51:31,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:51:31,427 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-23 00:51:37,303 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-23 00:51:39,376 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-23 00:51:41,492 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-23 00:51:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:43,600 INFO L93 Difference]: Finished difference Result 10466 states and 15931 transitions. [2022-07-23 00:51:43,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 00:51:43,601 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-23 00:51:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:43,679 INFO L225 Difference]: With dead ends: 10466 [2022-07-23 00:51:43,679 INFO L226 Difference]: Without dead ends: 5461 [2022-07-23 00:51:43,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:51:43,702 INFO L413 NwaCegarLoop]: 1101 mSDtfsCounter, 182 mSDsluCounter, 3759 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 154 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 00:51:43,702 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.9s Time] [2022-07-23 00:51:43,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2022-07-23 00:51:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 5006. [2022-07-23 00:51:43,931 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-23 00:51:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5006 states to 5006 states and 7546 transitions. [2022-07-23 00:51:43,952 INFO L78 Accepts]: Start accepts. Automaton has 5006 states and 7546 transitions. Word has length 77 [2022-07-23 00:51:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:43,954 INFO L495 AbstractCegarLoop]: Abstraction has 5006 states and 7546 transitions. [2022-07-23 00:51:43,954 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-23 00:51:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 5006 states and 7546 transitions. [2022-07-23 00:51:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-23 00:51:43,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:43,962 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-23 00:51:43,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 00:51:43,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1710126176, now seen corresponding path program 1 times [2022-07-23 00:51:43,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:43,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448799771] [2022-07-23 00:51:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:43,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 00:51:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-23 00:51:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 00:51:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:51:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 00:51:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 00:51:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:44,297 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-23 00:51:44,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:44,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448799771] [2022-07-23 00:51:44,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448799771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:44,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:44,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:51:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730199879] [2022-07-23 00:51:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:44,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:51:44,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:44,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:51:44,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:51:44,302 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-23 00:51:49,746 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-23 00:51:51,799 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-23 00:51:53,884 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-23 00:51:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:51:55,580 INFO L93 Difference]: Finished difference Result 11182 states and 17097 transitions. [2022-07-23 00:51:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 00:51:55,581 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-23 00:51:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:51:55,623 INFO L225 Difference]: With dead ends: 11182 [2022-07-23 00:51:55,623 INFO L226 Difference]: Without dead ends: 6179 [2022-07-23 00:51:55,644 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-23 00:51:55,645 INFO L413 NwaCegarLoop]: 1353 mSDtfsCounter, 728 mSDsluCounter, 3621 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 339 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4974 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-23 00:51:55,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4974 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 1066 Invalid, 3 Unknown, 0 Unchecked, 11.1s Time] [2022-07-23 00:51:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-23 00:51:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5014. [2022-07-23 00:51:55,929 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-23 00:51:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 7554 transitions. [2022-07-23 00:51:55,947 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 7554 transitions. Word has length 104 [2022-07-23 00:51:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:51:55,949 INFO L495 AbstractCegarLoop]: Abstraction has 5014 states and 7554 transitions. [2022-07-23 00:51:55,949 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-23 00:51:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 7554 transitions. [2022-07-23 00:51:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-23 00:51:55,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:51:55,953 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-23 00:51:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 00:51:55,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:51:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:51:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1744883690, now seen corresponding path program 1 times [2022-07-23 00:51:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:51:55,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763756114] [2022-07-23 00:51:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:51:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:51:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:51:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 00:51:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-23 00:51:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-23 00:51:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:51:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 00:51:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-23 00:51:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:51:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:51:56,211 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-23 00:51:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:51:56,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763756114] [2022-07-23 00:51:56,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763756114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:51:56,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:51:56,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:51:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916368675] [2022-07-23 00:51:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:51:56,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:51:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:51:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:51:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:51:56,213 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-23 00:52:00,585 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-23 00:52:03,629 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-23 00:52:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:52:05,020 INFO L93 Difference]: Finished difference Result 10407 states and 16031 transitions. [2022-07-23 00:52:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 00:52:05,021 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-23 00:52:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:52:05,044 INFO L225 Difference]: With dead ends: 10407 [2022-07-23 00:52:05,044 INFO L226 Difference]: Without dead ends: 5396 [2022-07-23 00:52:05,070 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-23 00:52:05,071 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 1187 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 463 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-23 00:52:05,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 2263 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 515 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2022-07-23 00:52:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2022-07-23 00:52:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 4990. [2022-07-23 00:52:05,309 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-23 00:52:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 7262 transitions. [2022-07-23 00:52:05,331 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 7262 transitions. Word has length 102 [2022-07-23 00:52:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:52:05,331 INFO L495 AbstractCegarLoop]: Abstraction has 4990 states and 7262 transitions. [2022-07-23 00:52:05,331 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-23 00:52:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 7262 transitions. [2022-07-23 00:52:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 00:52:05,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:52:05,335 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-23 00:52:05,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 00:52:05,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:52:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:52:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1621242927, now seen corresponding path program 1 times [2022-07-23 00:52:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:52:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035732077] [2022-07-23 00:52:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:52:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:52:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:52:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-23 00:52:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-23 00:52:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-23 00:52:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 00:52:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:52:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 00:52:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-23 00:52:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:05,682 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-23 00:52:05,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:52:05,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035732077] [2022-07-23 00:52:05,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035732077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:52:05,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:52:05,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:52:05,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475297543] [2022-07-23 00:52:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:52:05,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:52:05,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:52:05,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:52:05,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:52:05,686 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-23 00:52:12,867 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-23 00:52:14,932 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-23 00:52:16,997 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-23 00:52:19,129 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-23 00:52:21,181 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-23 00:52:23,302 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-23 00:52:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:52:25,406 INFO L93 Difference]: Finished difference Result 15758 states and 23270 transitions. [2022-07-23 00:52:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:52:25,407 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-23 00:52:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:52:25,458 INFO L225 Difference]: With dead ends: 15758 [2022-07-23 00:52:25,458 INFO L226 Difference]: Without dead ends: 10771 [2022-07-23 00:52:25,478 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-23 00:52:25,479 INFO L413 NwaCegarLoop]: 1675 mSDtfsCounter, 1264 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 537 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-07-23 00:52:25,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 4532 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 1201 Invalid, 6 Unknown, 0 Unchecked, 19.3s Time] [2022-07-23 00:52:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2022-07-23 00:52:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9936. [2022-07-23 00:52:25,965 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-23 00:52:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9936 states to 9936 states and 14464 transitions. [2022-07-23 00:52:26,007 INFO L78 Accepts]: Start accepts. Automaton has 9936 states and 14464 transitions. Word has length 108 [2022-07-23 00:52:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:52:26,008 INFO L495 AbstractCegarLoop]: Abstraction has 9936 states and 14464 transitions. [2022-07-23 00:52:26,008 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-23 00:52:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 9936 states and 14464 transitions. [2022-07-23 00:52:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-23 00:52:26,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:52:26,013 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-23 00:52:26,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 00:52:26,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:52:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:52:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1012080502, now seen corresponding path program 1 times [2022-07-23 00:52:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:52:26,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796813631] [2022-07-23 00:52:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:52:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:52:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:52:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:52:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:52:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:52:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 00:52:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:52:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 00:52:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 00:52:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:26,325 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-23 00:52:26,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:52:26,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796813631] [2022-07-23 00:52:26,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796813631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:52:26,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:52:26,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:52:26,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697329603] [2022-07-23 00:52:26,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:52:26,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:52:26,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:52:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:52:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:52:26,327 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-23 00:52:32,379 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-23 00:52:34,464 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-23 00:52:36,536 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-23 00:52:38,644 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-23 00:52:40,678 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-23 00:52:42,827 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-23 00:52:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:52:44,834 INFO L93 Difference]: Finished difference Result 25936 states and 38367 transitions. [2022-07-23 00:52:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:52:44,835 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-23 00:52:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:52:44,920 INFO L225 Difference]: With dead ends: 25936 [2022-07-23 00:52:44,921 INFO L226 Difference]: Without dead ends: 16003 [2022-07-23 00:52:44,949 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-23 00:52:44,950 INFO L413 NwaCegarLoop]: 1719 mSDtfsCounter, 1183 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 642 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 4487 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-07-23 00:52:44,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 4487 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 1217 Invalid, 6 Unknown, 0 Unchecked, 18.0s Time] [2022-07-23 00:52:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16003 states. [2022-07-23 00:52:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16003 to 14784. [2022-07-23 00:52:45,637 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-23 00:52:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14784 states to 14784 states and 21472 transitions. [2022-07-23 00:52:45,697 INFO L78 Accepts]: Start accepts. Automaton has 14784 states and 21472 transitions. Word has length 110 [2022-07-23 00:52:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:52:45,698 INFO L495 AbstractCegarLoop]: Abstraction has 14784 states and 21472 transitions. [2022-07-23 00:52:45,698 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-23 00:52:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 14784 states and 21472 transitions. [2022-07-23 00:52:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-23 00:52:45,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:52:45,706 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-23 00:52:45,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 00:52:45,707 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:52:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:52:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1582291269, now seen corresponding path program 1 times [2022-07-23 00:52:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:52:45,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181781054] [2022-07-23 00:52:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:52:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:52:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:45,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:52:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:52:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:45,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:52:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:52:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 00:52:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:52:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-23 00:52:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-23 00:52:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:52:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:52:46,034 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-23 00:52:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:52:46,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181781054] [2022-07-23 00:52:46,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181781054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:52:46,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:52:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 00:52:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493080324] [2022-07-23 00:52:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:52:46,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 00:52:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:52:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 00:52:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 00:52:46,037 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-23 00:52:52,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:52:54,361 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-23 00:52:56,431 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-23 00:52:58,519 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-23 00:53:00,736 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-23 00:53:02,768 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-23 00:53:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:53:04,853 INFO L93 Difference]: Finished difference Result 36024 states and 53119 transitions. [2022-07-23 00:53:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 00:53:04,854 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-23 00:53:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:53:05,017 INFO L225 Difference]: With dead ends: 36024 [2022-07-23 00:53:05,018 INFO L226 Difference]: Without dead ends: 21243 [2022-07-23 00:53:05,059 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-23 00:53:05,060 INFO L413 NwaCegarLoop]: 1932 mSDtfsCounter, 1189 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 607 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 5035 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:53:05,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 5035 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 1240 Invalid, 5 Unknown, 0 Unchecked, 18.2s Time] [2022-07-23 00:53:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21243 states. [2022-07-23 00:53:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21243 to 19632. [2022-07-23 00:53:05,933 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-23 00:53:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19632 states to 19632 states and 28480 transitions. [2022-07-23 00:53:06,019 INFO L78 Accepts]: Start accepts. Automaton has 19632 states and 28480 transitions. Word has length 131 [2022-07-23 00:53:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:53:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 19632 states and 28480 transitions. [2022-07-23 00:53:06,020 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-23 00:53:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19632 states and 28480 transitions. [2022-07-23 00:53:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-23 00:53:06,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:53:06,030 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-23 00:53:06,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 00:53:06,030 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:53:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:53:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1020367177, now seen corresponding path program 1 times [2022-07-23 00:53:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:53:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954443998] [2022-07-23 00:53:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:53:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:53:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:53:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:53:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:53:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:53:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:53:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:53:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 00:53:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:53:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:53:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:53:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:53:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:53:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 00:53:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 00:53:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:53:06,386 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-23 00:53:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:53:06,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954443998] [2022-07-23 00:53:06,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954443998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:53:06,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:53:06,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:53:06,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512363573] [2022-07-23 00:53:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:53:06,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:53:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:53:06,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:53:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:53:06,389 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-23 00:53:13,931 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-23 00:53:15,962 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-23 00:53:17,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:53:20,018 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-23 00:53:22,160 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-23 00:53:24,185 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-23 00:53:26,209 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-23 00:53:28,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:53:30,455 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-23 00:53:32,484 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-23 00:53:34,511 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-23 00:53:36,543 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-23 00:53:39,405 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-23 00:53:41,432 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-23 00:53:43,460 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-23 00:53:46,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:53:47,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:53:49,484 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-23 00:53:50,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:53:52,687 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-23 00:53:54,713 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-23 00:53:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:53:59,178 INFO L93 Difference]: Finished difference Result 46112 states and 67871 transitions. [2022-07-23 00:53:59,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 00:53:59,179 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-23 00:53:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:53:59,329 INFO L225 Difference]: With dead ends: 46112 [2022-07-23 00:53:59,329 INFO L226 Difference]: Without dead ends: 26483 [2022-07-23 00:53:59,382 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-23 00:53:59,383 INFO L413 NwaCegarLoop]: 1734 mSDtfsCounter, 1439 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 4908 mSolverCounterSat, 829 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 3432 SdHoareTripleChecker+Invalid, 5756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 4908 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.9s IncrementalHoareTripleChecker+Time [2022-07-23 00:53:59,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 3432 Invalid, 5756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [829 Valid, 4908 Invalid, 19 Unknown, 0 Unchecked, 51.9s Time] [2022-07-23 00:53:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2022-07-23 00:54:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 24480. [2022-07-23 00:54:00,454 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-23 00:54:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35488 transitions. [2022-07-23 00:54:00,557 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35488 transitions. Word has length 152 [2022-07-23 00:54:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:54:00,557 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35488 transitions. [2022-07-23 00:54:00,558 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-23 00:54:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35488 transitions. [2022-07-23 00:54:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-23 00:54:00,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:54:00,570 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-23 00:54:00,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 00:54:00,570 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:54:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:54:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2130073905, now seen corresponding path program 1 times [2022-07-23 00:54:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:54:00,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020844053] [2022-07-23 00:54:00,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:54:00,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:54:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:54:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:54:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:54:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:54:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 00:54:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:54:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 00:54:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:54:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 00:54:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 00:54:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:00,969 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-23 00:54:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:54:00,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020844053] [2022-07-23 00:54:00,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020844053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:54:00,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:54:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 00:54:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128986809] [2022-07-23 00:54:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:54:00,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 00:54:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:54:00,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 00:54:00,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 00:54:00,972 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-23 00:54:03,253 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-23 00:54:07,490 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-23 00:54:09,516 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-23 00:54:11,548 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-23 00:54:13,573 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-23 00:54:15,752 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-23 00:54:17,783 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-23 00:54:19,809 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-23 00:54:21,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:54:24,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:54:26,055 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-23 00:54:28,081 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-23 00:54:30,108 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-23 00:54:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 00:54:33,170 INFO L93 Difference]: Finished difference Result 50943 states and 74695 transitions. [2022-07-23 00:54:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 00:54:33,170 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-23 00:54:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 00:54:33,319 INFO L225 Difference]: With dead ends: 50943 [2022-07-23 00:54:33,319 INFO L226 Difference]: Without dead ends: 26466 [2022-07-23 00:54:33,382 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-23 00:54:33,384 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 1762 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 1092 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 4132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1092 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2022-07-23 00:54:33,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 2182 Invalid, 4132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1092 Valid, 3029 Invalid, 11 Unknown, 0 Unchecked, 31.2s Time] [2022-07-23 00:54:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26466 states. [2022-07-23 00:54:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26466 to 24480. [2022-07-23 00:54:34,566 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-23 00:54:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24480 states to 24480 states and 35484 transitions. [2022-07-23 00:54:34,668 INFO L78 Accepts]: Start accepts. Automaton has 24480 states and 35484 transitions. Word has length 153 [2022-07-23 00:54:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 00:54:34,669 INFO L495 AbstractCegarLoop]: Abstraction has 24480 states and 35484 transitions. [2022-07-23 00:54:34,669 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-23 00:54:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 24480 states and 35484 transitions. [2022-07-23 00:54:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-23 00:54:34,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 00:54:34,682 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-23 00:54:34,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 00:54:34,682 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-23 00:54:34,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 00:54:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash 574017791, now seen corresponding path program 1 times [2022-07-23 00:54:34,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 00:54:34,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711420268] [2022-07-23 00:54:34,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 00:54:34,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 00:54:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 00:54:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-23 00:54:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 00:54:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 00:54:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-23 00:54:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:54:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-23 00:54:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:35,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 00:54:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 00:54:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 00:54:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 00:54:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 00:54:35,021 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-23 00:54:35,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 00:54:35,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711420268] [2022-07-23 00:54:35,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711420268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 00:54:35,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 00:54:35,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 00:54:35,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121196693] [2022-07-23 00:54:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 00:54:35,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 00:54:35,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 00:54:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 00:54:35,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-23 00:54:35,024 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-23 00:54:37,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:54:43,877 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-23 00:54:45,904 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-23 00:54:47,936 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-23 00:54:49,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-23 00:54:52,141 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-23 00:54:54,166 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-23 00:54:56,194 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-23 00:54:58,217 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-23 00:55:00,456 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-23 00:55:02,488 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-23 00:55:04,513 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-23 00:55:06,542 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-23 00:55:08,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:55:10,518 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-23 00:55:12,548 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-23 00:55:15,137 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-23 00:55:17,167 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-23 00:55:18,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 00:55:20,550 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 []