./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.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 2eef4809e0fb5b801f2479dfde07a6f5e1ac3784201f878d167f0654e03bdeae --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 23:57:50,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:57:50,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:57:50,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:57:50,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:57:50,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:57:50,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:57:50,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:57:50,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:57:50,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:57:50,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:57:50,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:57:50,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:57:50,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:57:50,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:57:50,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:57:50,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:57:50,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:57:50,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:57:50,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:57:50,158 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:57:50,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:57:50,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:57:50,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:57:50,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:57:50,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:57:50,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:57:50,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:57:50,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:57:50,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:57:50,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:57:50,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:57:50,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:57:50,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:57:50,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:57:50,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:57:50,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:57:50,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:57:50,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:57:50,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:57:50,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:57:50,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:57:50,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:57:50,195 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:57:50,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:57:50,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:57:50,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:57:50,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:57:50,197 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:57:50,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:57:50,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:57:50,198 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:57:50,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:57:50,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:57:50,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:57:50,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:57:50,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:57:50,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:57:50,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:57:50,199 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:57:50,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:57:50,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:57:50,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:57:50,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:57:50,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:57:50,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:57:50,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:57:50,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:57:50,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:57:50,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:57:50,201 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:57:50,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:57:50,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:57:50,202 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 -> 2eef4809e0fb5b801f2479dfde07a6f5e1ac3784201f878d167f0654e03bdeae [2022-07-13 23:57:50,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:57:50,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:57:50,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:57:50,432 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:57:50,433 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:57:50,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-07-13 23:57:50,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1040017/44e67e80997946dba16d838f09360fdb/FLAG251504f0b [2022-07-13 23:57:51,190 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:57:51,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-07-13 23:57:51,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1040017/44e67e80997946dba16d838f09360fdb/FLAG251504f0b [2022-07-13 23:57:51,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1040017/44e67e80997946dba16d838f09360fdb [2022-07-13 23:57:51,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:57:51,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:57:51,518 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:57:51,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:57:51,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:57:51,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:57:51" (1/1) ... [2022-07-13 23:57:51,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b19b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:51, skipping insertion in model container [2022-07-13 23:57:51,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:57:51" (1/1) ... [2022-07-13 23:57:51,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:57:51,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:57:53,147 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-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i[269371,269384] [2022-07-13 23:57:53,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:57:53,257 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:57:53,614 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-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i[269371,269384] [2022-07-13 23:57:53,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:57:53,729 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:57:53,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53 WrapperNode [2022-07-13 23:57:53,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:57:53,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:57:53,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:57:53,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:57:53,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:53,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,111 INFO L137 Inliner]: procedures = 282, calls = 3066, calls flagged for inlining = 129, calls inlined = 120, statements flattened = 6882 [2022-07-13 23:57:54,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:57:54,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:57:54,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:57:54,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:57:54,121 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:57:54,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:57:54,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:57:54,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:57:54,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (1/1) ... [2022-07-13 23:57:54,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:57:54,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:57:54,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 23:57:54,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 23:57:54,709 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-07-13 23:57:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-13 23:57:54,710 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-13 23:57:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:57:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:57:54,710 INFO L130 BoogieDeclarations]: Found specification of procedure driver_remove_file [2022-07-13 23:57:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_remove_file [2022-07-13 23:57:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure find_partition [2022-07-13 23:57:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure find_partition [2022-07-13 23:57:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-13 23:57:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-13 23:57:54,711 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_block_when_processing_errors [2022-07-13 23:57:54,711 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_block_when_processing_errors [2022-07-13 23:57:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-07-13 23:57:54,712 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-07-13 23:57:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-13 23:57:54,712 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-13 23:57:54,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:57:54,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:57:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure class_unregister [2022-07-13 23:57:54,713 INFO L138 BoogieDeclarations]: Found implementation of procedure class_unregister [2022-07-13 23:57:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 23:57:54,713 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 23:57:54,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-13 23:57:54,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-13 23:57:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure tape_name [2022-07-13 23:57:54,714 INFO L138 BoogieDeclarations]: Found implementation of procedure tape_name [2022-07-13 23:57:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 23:57:54,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 23:57:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 23:57:54,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 23:57:54,714 INFO L130 BoogieDeclarations]: Found specification of procedure st_int_ioctl [2022-07-13 23:57:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure st_int_ioctl [2022-07-13 23:57:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_rq_timeout [2022-07-13 23:57:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_rq_timeout [2022-07-13 23:57:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure set_mode_densblk [2022-07-13 23:57:54,715 INFO L138 BoogieDeclarations]: Found implementation of procedure set_mode_densblk [2022-07-13 23:57:54,715 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-13 23:57:54,716 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-13 23:57:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_ioctl [2022-07-13 23:57:54,716 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_ioctl [2022-07-13 23:57:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:57:54,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_st_ref_mutex [2022-07-13 23:57:54,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_st_ref_mutex [2022-07-13 23:57:54,717 INFO L130 BoogieDeclarations]: Found specification of procedure read_mode_page [2022-07-13 23:57:54,717 INFO L138 BoogieDeclarations]: Found implementation of procedure read_mode_page [2022-07-13 23:57:54,717 INFO L130 BoogieDeclarations]: Found specification of procedure do_door_lock [2022-07-13 23:57:54,717 INFO L138 BoogieDeclarations]: Found implementation of procedure do_door_lock [2022-07-13 23:57:54,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:57:54,718 INFO L130 BoogieDeclarations]: Found specification of procedure put_page [2022-07-13 23:57:54,718 INFO L138 BoogieDeclarations]: Found implementation of procedure put_page [2022-07-13 23:57:54,718 INFO L130 BoogieDeclarations]: Found specification of procedure st_do_scsi [2022-07-13 23:57:54,718 INFO L138 BoogieDeclarations]: Found implementation of procedure st_do_scsi [2022-07-13 23:57:54,719 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-07-13 23:57:54,719 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-13 23:57:54,719 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-13 23:57:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-07-13 23:57:54,720 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-07-13 23:57:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2022-07-13 23:57:54,721 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2022-07-13 23:57:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:57:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure st_release_request [2022-07-13 23:57:54,721 INFO L138 BoogieDeclarations]: Found implementation of procedure st_release_request [2022-07-13 23:57:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:57:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure remove_cdevs [2022-07-13 23:57:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_cdevs [2022-07-13 23:57:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-13 23:57:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-13 23:57:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-13 23:57:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-13 23:57:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure get_location [2022-07-13 23:57:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure get_location [2022-07-13 23:57:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure st_compression [2022-07-13 23:57:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure st_compression [2022-07-13 23:57:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_autopm_put_device [2022-07-13 23:57:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_autopm_put_device [2022-07-13 23:57:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-13 23:57:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-13 23:57:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 23:57:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 23:57:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 23:57:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 23:57:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure check_tape [2022-07-13 23:57:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure check_tape [2022-07-13 23:57:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-13 23:57:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-13 23:57:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-13 23:57:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-13 23:57:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure switch_partition [2022-07-13 23:57:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure switch_partition [2022-07-13 23:57:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_scsi_tape [2022-07-13 23:57:54,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_scsi_tape [2022-07-13 23:57:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 23:57:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-13 23:57:54,727 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-13 23:57:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure setup_buffering [2022-07-13 23:57:54,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_buffering [2022-07-13 23:57:54,728 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-13 23:57:54,728 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-13 23:57:54,729 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tape_put [2022-07-13 23:57:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tape_put [2022-07-13 23:57:54,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:57:54,729 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_cmd_ioctl [2022-07-13 23:57:54,729 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_cmd_ioctl [2022-07-13 23:57:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:57:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure create_one_cdev [2022-07-13 23:57:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure create_one_cdev [2022-07-13 23:57:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure queue_dma_alignment [2022-07-13 23:57:54,730 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_dma_alignment [2022-07-13 23:57:54,730 INFO L130 BoogieDeclarations]: Found specification of procedure do_load_unload [2022-07-13 23:57:54,731 INFO L138 BoogieDeclarations]: Found implementation of procedure do_load_unload [2022-07-13 23:57:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure st_flush_write_buffer [2022-07-13 23:57:54,731 INFO L138 BoogieDeclarations]: Found implementation of procedure st_flush_write_buffer [2022-07-13 23:57:54,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 23:57:54,731 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 23:57:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure enlarge_buffer [2022-07-13 23:57:54,732 INFO L138 BoogieDeclarations]: Found implementation of procedure enlarge_buffer [2022-07-13 23:57:54,732 INFO L130 BoogieDeclarations]: Found specification of procedure cross_eof [2022-07-13 23:57:54,733 INFO L138 BoogieDeclarations]: Found implementation of procedure cross_eof [2022-07-13 23:57:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure st_chk_result [2022-07-13 23:57:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure st_chk_result [2022-07-13 23:57:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2022-07-13 23:57:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2022-07-13 23:57:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 23:57:54,737 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 23:57:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure write_behind_check [2022-07-13 23:57:54,737 INFO L138 BoogieDeclarations]: Found implementation of procedure write_behind_check [2022-07-13 23:57:54,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:57:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-13 23:57:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-13 23:57:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-13 23:57:54,743 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-13 23:57:54,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-13 23:57:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-13 23:57:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_st_ref_mutex [2022-07-13 23:57:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_st_ref_mutex [2022-07-13 23:57:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:57:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-13 23:57:54,744 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-13 23:57:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:57:54,744 INFO L130 BoogieDeclarations]: Found specification of procedure flush_buffer [2022-07-13 23:57:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_buffer [2022-07-13 23:57:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2022-07-13 23:57:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2022-07-13 23:57:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:57:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-13 23:57:54,745 INFO L130 BoogieDeclarations]: Found specification of procedure driver_create_file [2022-07-13 23:57:54,745 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_create_file [2022-07-13 23:57:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure release_buffering [2022-07-13 23:57:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure release_buffering [2022-07-13 23:57:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-13 23:57:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-13 23:57:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure normalize_buffer [2022-07-13 23:57:54,746 INFO L138 BoogieDeclarations]: Found implementation of procedure normalize_buffer [2022-07-13 23:57:54,746 INFO L130 BoogieDeclarations]: Found specification of procedure write_mode_page [2022-07-13 23:57:54,747 INFO L138 BoogieDeclarations]: Found implementation of procedure write_mode_page [2022-07-13 23:57:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-13 23:57:54,747 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-13 23:57:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure rw_checks [2022-07-13 23:57:54,747 INFO L138 BoogieDeclarations]: Found implementation of procedure rw_checks [2022-07-13 23:57:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-13 23:57:54,747 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-13 23:57:54,747 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2022-07-13 23:57:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2022-07-13 23:57:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock_of_scsi_tape [2022-07-13 23:57:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock_of_scsi_tape [2022-07-13 23:57:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-13 23:57:54,748 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-13 23:57:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:57:54,748 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_autopm_get_device [2022-07-13 23:57:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_autopm_get_device [2022-07-13 23:57:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure set_location [2022-07-13 23:57:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure set_location [2022-07-13 23:57:54,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:57:54,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:57:55,657 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:57:55,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:58:02,990 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:58:03,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:58:03,010 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 23:58:03,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:58:03 BoogieIcfgContainer [2022-07-13 23:58:03,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:58:03,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:58:03,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:58:03,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:58:03,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:57:51" (1/3) ... [2022-07-13 23:58:03,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b9f74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:58:03, skipping insertion in model container [2022-07-13 23:58:03,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:57:53" (2/3) ... [2022-07-13 23:58:03,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b9f74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:58:03, skipping insertion in model container [2022-07-13 23:58:03,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:58:03" (3/3) ... [2022-07-13 23:58:03,024 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-07-13 23:58:03,036 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:58:03,036 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:58:03,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:58:03,129 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@28598952, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73bbafbd [2022-07-13 23:58:03,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:58:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 2182 states, 1757 states have (on average 1.5054069436539557) internal successors, (2645), 1779 states have internal predecessors, (2645), 345 states have call successors, (345), 78 states have call predecessors, (345), 78 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) [2022-07-13 23:58:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 23:58:03,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:03,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:58:03,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 426041223, now seen corresponding path program 1 times [2022-07-13 23:58:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:03,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315357961] [2022-07-13 23:58:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:03,667 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-13 23:58:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:03,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315357961] [2022-07-13 23:58:03,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315357961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:03,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:03,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:58:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122270605] [2022-07-13 23:58:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:03,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:58:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:58:03,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:58:03,708 INFO L87 Difference]: Start difference. First operand has 2182 states, 1757 states have (on average 1.5054069436539557) internal successors, (2645), 1779 states have internal predecessors, (2645), 345 states have call successors, (345), 78 states have call predecessors, (345), 78 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 23:58:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:03,929 INFO L93 Difference]: Finished difference Result 4356 states and 6772 transitions. [2022-07-13 23:58:03,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:58:03,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-07-13 23:58:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:03,964 INFO L225 Difference]: With dead ends: 4356 [2022-07-13 23:58:03,964 INFO L226 Difference]: Without dead ends: 2176 [2022-07-13 23:58:03,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 23:58:03,988 INFO L413 NwaCegarLoop]: 3295 mSDtfsCounter, 3291 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:03,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 3295 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:58:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2022-07-13 23:58:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2022-07-13 23:58:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1753 states have (on average 1.488876212207644) internal successors, (2610), 1773 states have internal predecessors, (2610), 345 states have call successors, (345), 78 states have call predecessors, (345), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-07-13 23:58:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3292 transitions. [2022-07-13 23:58:04,144 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3292 transitions. Word has length 18 [2022-07-13 23:58:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:04,146 INFO L495 AbstractCegarLoop]: Abstraction has 2176 states and 3292 transitions. [2022-07-13 23:58:04,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 23:58:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3292 transitions. [2022-07-13 23:58:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 23:58:04,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:04,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:58:04,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:58:04,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1127105801, now seen corresponding path program 1 times [2022-07-13 23:58:04,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:04,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018940903] [2022-07-13 23:58:04,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:04,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:04,376 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-13 23:58:04,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:04,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018940903] [2022-07-13 23:58:04,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018940903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:04,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:04,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:58:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654525283] [2022-07-13 23:58:04,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:04,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:58:04,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:58:04,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:58:04,382 INFO L87 Difference]: Start difference. First operand 2176 states and 3292 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 23:58:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:04,477 INFO L93 Difference]: Finished difference Result 4345 states and 6575 transitions. [2022-07-13 23:58:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:58:04,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-07-13 23:58:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:04,493 INFO L225 Difference]: With dead ends: 4345 [2022-07-13 23:58:04,493 INFO L226 Difference]: Without dead ends: 2176 [2022-07-13 23:58:04,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 23:58:04,503 INFO L413 NwaCegarLoop]: 3290 mSDtfsCounter, 3285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3285 SdHoareTripleChecker+Valid, 3290 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:04,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3285 Valid, 3290 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:58:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2022-07-13 23:58:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2022-07-13 23:58:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1753 states have (on average 1.4883057615516257) internal successors, (2609), 1773 states have internal predecessors, (2609), 345 states have call successors, (345), 78 states have call predecessors, (345), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-07-13 23:58:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3291 transitions. [2022-07-13 23:58:04,585 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3291 transitions. Word has length 18 [2022-07-13 23:58:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:04,585 INFO L495 AbstractCegarLoop]: Abstraction has 2176 states and 3291 transitions. [2022-07-13 23:58:04,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 23:58:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3291 transitions. [2022-07-13 23:58:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 23:58:04,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:04,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:58:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:58:04,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:04,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash 734078791, now seen corresponding path program 1 times [2022-07-13 23:58:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:04,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481676261] [2022-07-13 23:58:04,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:04,723 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-13 23:58:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481676261] [2022-07-13 23:58:04,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481676261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:04,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:04,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:58:04,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128400081] [2022-07-13 23:58:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:04,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:58:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:58:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:58:04,726 INFO L87 Difference]: Start difference. First operand 2176 states and 3291 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 23:58:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:04,821 INFO L93 Difference]: Finished difference Result 2178 states and 3292 transitions. [2022-07-13 23:58:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:58:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-07-13 23:58:04,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:04,834 INFO L225 Difference]: With dead ends: 2178 [2022-07-13 23:58:04,834 INFO L226 Difference]: Without dead ends: 2175 [2022-07-13 23:58:04,837 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-13 23:58:04,841 INFO L413 NwaCegarLoop]: 3288 mSDtfsCounter, 3276 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:04,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 3288 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:58:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2022-07-13 23:58:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 2175. [2022-07-13 23:58:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 1753 states have (on average 1.4877353108956075) internal successors, (2608), 1772 states have internal predecessors, (2608), 344 states have call successors, (344), 78 states have call predecessors, (344), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-07-13 23:58:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3289 transitions. [2022-07-13 23:58:04,922 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3289 transitions. Word has length 18 [2022-07-13 23:58:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:04,923 INFO L495 AbstractCegarLoop]: Abstraction has 2175 states and 3289 transitions. [2022-07-13 23:58:04,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-13 23:58:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3289 transitions. [2022-07-13 23:58:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 23:58:04,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:04,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:58:04,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:58:04,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1280897129, now seen corresponding path program 1 times [2022-07-13 23:58:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:04,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209652954] [2022-07-13 23:58:04,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:04,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:05,065 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-13 23:58:05,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:05,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209652954] [2022-07-13 23:58:05,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209652954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:05,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:05,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:58:05,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898411882] [2022-07-13 23:58:05,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:05,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:58:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:58:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:58:05,068 INFO L87 Difference]: Start difference. First operand 2175 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 23:58:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:05,300 INFO L93 Difference]: Finished difference Result 6401 states and 9695 transitions. [2022-07-13 23:58:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:58:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-07-13 23:58:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:05,330 INFO L225 Difference]: With dead ends: 6401 [2022-07-13 23:58:05,330 INFO L226 Difference]: Without dead ends: 4267 [2022-07-13 23:58:05,342 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-13 23:58:05,348 INFO L413 NwaCegarLoop]: 5401 mSDtfsCounter, 3271 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3271 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:05,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3271 Valid, 8567 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 23:58:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2022-07-13 23:58:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4262. [2022-07-13 23:58:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 3448 states have (on average 1.4895591647331787) internal successors, (5136), 3479 states have internal predecessors, (5136), 662 states have call successors, (662), 153 states have call predecessors, (662), 151 states have return successors, (657), 651 states have call predecessors, (657), 651 states have call successors, (657) [2022-07-13 23:58:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 6455 transitions. [2022-07-13 23:58:05,557 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 6455 transitions. Word has length 19 [2022-07-13 23:58:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:05,558 INFO L495 AbstractCegarLoop]: Abstraction has 4262 states and 6455 transitions. [2022-07-13 23:58:05,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 23:58:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 6455 transitions. [2022-07-13 23:58:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 23:58:05,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:05,560 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] [2022-07-13 23:58:05,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:58:05,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:05,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:05,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1052401290, now seen corresponding path program 1 times [2022-07-13 23:58:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:05,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83917615] [2022-07-13 23:58:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:05,673 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-13 23:58:05,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:05,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83917615] [2022-07-13 23:58:05,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83917615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:05,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:05,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:58:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183735256] [2022-07-13 23:58:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:05,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:58:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:58:05,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:58:05,676 INFO L87 Difference]: Start difference. First operand 4262 states and 6455 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-13 23:58:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:05,802 INFO L93 Difference]: Finished difference Result 4264 states and 6456 transitions. [2022-07-13 23:58:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:58:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-07-13 23:58:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:05,828 INFO L225 Difference]: With dead ends: 4264 [2022-07-13 23:58:05,829 INFO L226 Difference]: Without dead ends: 4261 [2022-07-13 23:58:05,831 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-13 23:58:05,832 INFO L413 NwaCegarLoop]: 3286 mSDtfsCounter, 3272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:05,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 3286 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:58:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2022-07-13 23:58:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4261. [2022-07-13 23:58:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3448 states have (on average 1.4892691415313226) internal successors, (5135), 3478 states have internal predecessors, (5135), 661 states have call successors, (661), 153 states have call predecessors, (661), 151 states have return successors, (657), 651 states have call predecessors, (657), 651 states have call successors, (657) [2022-07-13 23:58:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6453 transitions. [2022-07-13 23:58:05,975 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6453 transitions. Word has length 20 [2022-07-13 23:58:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:05,976 INFO L495 AbstractCegarLoop]: Abstraction has 4261 states and 6453 transitions. [2022-07-13 23:58:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-13 23:58:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6453 transitions. [2022-07-13 23:58:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 23:58:05,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:05,977 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-13 23:58:05,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 23:58:05,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:05,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1735997556, now seen corresponding path program 1 times [2022-07-13 23:58:05,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:05,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040565646] [2022-07-13 23:58:05,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:05,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,076 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-13 23:58:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:06,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040565646] [2022-07-13 23:58:06,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040565646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:06,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:06,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:58:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429468967] [2022-07-13 23:58:06,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:06,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:58:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:06,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:58:06,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:58:06,078 INFO L87 Difference]: Start difference. First operand 4261 states and 6453 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-13 23:58:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:06,206 INFO L93 Difference]: Finished difference Result 4333 states and 6511 transitions. [2022-07-13 23:58:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:58:06,207 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), 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 21 [2022-07-13 23:58:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:06,233 INFO L225 Difference]: With dead ends: 4333 [2022-07-13 23:58:06,234 INFO L226 Difference]: Without dead ends: 4312 [2022-07-13 23:58:06,239 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-13 23:58:06,240 INFO L413 NwaCegarLoop]: 3288 mSDtfsCounter, 3107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3107 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:06,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3107 Valid, 3473 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 23:58:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2022-07-13 23:58:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4310. [2022-07-13 23:58:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3491 states have (on average 1.4818103695216271) internal successors, (5173), 3519 states have internal predecessors, (5173), 651 states have call successors, (651), 169 states have call predecessors, (651), 167 states have return successors, (649), 643 states have call predecessors, (649), 643 states have call successors, (649) [2022-07-13 23:58:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6473 transitions. [2022-07-13 23:58:06,475 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6473 transitions. Word has length 21 [2022-07-13 23:58:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:06,475 INFO L495 AbstractCegarLoop]: Abstraction has 4310 states and 6473 transitions. [2022-07-13 23:58:06,476 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), 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-13 23:58:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6473 transitions. [2022-07-13 23:58:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 23:58:06,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:06,486 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:58:06,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 23:58:06,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:06,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1313551294, now seen corresponding path program 1 times [2022-07-13 23:58:06,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:06,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721272735] [2022-07-13 23:58:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 23:58:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:58:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:58:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:58:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:58:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 23:58:06,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:06,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721272735] [2022-07-13 23:58:06,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721272735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:06,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:06,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:58:06,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092961483] [2022-07-13 23:58:06,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:06,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:58:06,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:06,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:58:06,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:58:06,690 INFO L87 Difference]: Start difference. First operand 4310 states and 6473 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 23:58:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:11,051 INFO L93 Difference]: Finished difference Result 8570 states and 12881 transitions. [2022-07-13 23:58:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:58:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-07-13 23:58:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:11,079 INFO L225 Difference]: With dead ends: 8570 [2022-07-13 23:58:11,079 INFO L226 Difference]: Without dead ends: 4313 [2022-07-13 23:58:11,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:58:11,101 INFO L413 NwaCegarLoop]: 4180 mSDtfsCounter, 4705 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 7449 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:11,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 7449 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [913 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-13 23:58:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2022-07-13 23:58:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4310. [2022-07-13 23:58:11,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3491 states have (on average 1.4812374677742768) internal successors, (5171), 3519 states have internal predecessors, (5171), 651 states have call successors, (651), 169 states have call predecessors, (651), 167 states have return successors, (643), 643 states have call predecessors, (643), 640 states have call successors, (643) [2022-07-13 23:58:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6465 transitions. [2022-07-13 23:58:11,245 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6465 transitions. Word has length 61 [2022-07-13 23:58:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:11,246 INFO L495 AbstractCegarLoop]: Abstraction has 4310 states and 6465 transitions. [2022-07-13 23:58:11,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 23:58:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6465 transitions. [2022-07-13 23:58:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 23:58:11,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:11,250 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:58:11,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 23:58:11,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:11,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2136944131, now seen corresponding path program 1 times [2022-07-13 23:58:11,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:11,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216651625] [2022-07-13 23:58:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 23:58:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:58:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:58:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:58:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:58:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 23:58:11,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:11,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216651625] [2022-07-13 23:58:11,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216651625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:11,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:11,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:58:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925527166] [2022-07-13 23:58:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:11,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:58:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:11,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:58:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:58:11,527 INFO L87 Difference]: Start difference. First operand 4310 states and 6465 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 23:58:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:18,535 INFO L93 Difference]: Finished difference Result 6392 states and 9710 transitions. [2022-07-13 23:58:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:58:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-07-13 23:58:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:18,566 INFO L225 Difference]: With dead ends: 6392 [2022-07-13 23:58:18,567 INFO L226 Difference]: Without dead ends: 5310 [2022-07-13 23:58:18,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:58:18,577 INFO L413 NwaCegarLoop]: 4247 mSDtfsCounter, 2864 mSDsluCounter, 10609 mSDsCounter, 0 mSdLazyCounter, 7685 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 14856 SdHoareTripleChecker+Invalid, 8319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 7685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:18,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 14856 Invalid, 8319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [634 Valid, 7685 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-13 23:58:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2022-07-13 23:58:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3961. [2022-07-13 23:58:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3182 states have (on average 1.4685732243871779) internal successors, (4673), 3208 states have internal predecessors, (4673), 612 states have call successors, (612), 168 states have call predecessors, (612), 166 states have return successors, (606), 606 states have call predecessors, (606), 603 states have call successors, (606) [2022-07-13 23:58:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5891 transitions. [2022-07-13 23:58:18,755 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5891 transitions. Word has length 61 [2022-07-13 23:58:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:18,756 INFO L495 AbstractCegarLoop]: Abstraction has 3961 states and 5891 transitions. [2022-07-13 23:58:18,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 23:58:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5891 transitions. [2022-07-13 23:58:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 23:58:18,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:18,761 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:58:18,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 23:58:18,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:18,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1364454553, now seen corresponding path program 1 times [2022-07-13 23:58:18,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:18,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099285331] [2022-07-13 23:58:18,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:18,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:58:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 23:58:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 23:58:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:58:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 23:58:18,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:18,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099285331] [2022-07-13 23:58:18,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099285331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:18,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:18,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:58:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254691295] [2022-07-13 23:58:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:18,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:58:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:58:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:58:18,988 INFO L87 Difference]: Start difference. First operand 3961 states and 5891 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 23:58:22,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:58:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:26,915 INFO L93 Difference]: Finished difference Result 8987 states and 13565 transitions. [2022-07-13 23:58:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:58:26,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2022-07-13 23:58:26,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:26,948 INFO L225 Difference]: With dead ends: 8987 [2022-07-13 23:58:26,949 INFO L226 Difference]: Without dead ends: 5079 [2022-07-13 23:58:26,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:58:26,966 INFO L413 NwaCegarLoop]: 3169 mSDtfsCounter, 2617 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1050 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2910 SdHoareTripleChecker+Valid, 6747 SdHoareTripleChecker+Invalid, 5297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:26,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2910 Valid, 6747 Invalid, 5297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4246 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-07-13 23:58:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2022-07-13 23:58:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 4784. [2022-07-13 23:58:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 3864 states have (on average 1.4754140786749483) internal successors, (5701), 3895 states have internal predecessors, (5701), 753 states have call successors, (753), 168 states have call predecessors, (753), 166 states have return successors, (748), 748 states have call predecessors, (748), 744 states have call successors, (748) [2022-07-13 23:58:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 7202 transitions. [2022-07-13 23:58:27,238 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 7202 transitions. Word has length 63 [2022-07-13 23:58:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:27,239 INFO L495 AbstractCegarLoop]: Abstraction has 4784 states and 7202 transitions. [2022-07-13 23:58:27,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 23:58:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 7202 transitions. [2022-07-13 23:58:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-13 23:58:27,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:27,243 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2022-07-13 23:58:27,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 23:58:27,243 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:27,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1555859730, now seen corresponding path program 1 times [2022-07-13 23:58:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:27,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234195906] [2022-07-13 23:58:27,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 23:58:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:58:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 23:58:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:58:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 23:58:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 23:58:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:58:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:27,456 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 23:58:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:27,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234195906] [2022-07-13 23:58:27,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234195906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:27,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:27,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:58:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315457487] [2022-07-13 23:58:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:27,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:58:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:27,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:58:27,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:58:27,459 INFO L87 Difference]: Start difference. First operand 4784 states and 7202 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:58:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:34,076 INFO L93 Difference]: Finished difference Result 8110 states and 12296 transitions. [2022-07-13 23:58:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:58:34,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2022-07-13 23:58:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:34,148 INFO L225 Difference]: With dead ends: 8110 [2022-07-13 23:58:34,148 INFO L226 Difference]: Without dead ends: 6592 [2022-07-13 23:58:34,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:58:34,155 INFO L413 NwaCegarLoop]: 4236 mSDtfsCounter, 3860 mSDsluCounter, 9569 mSDsCounter, 0 mSdLazyCounter, 7605 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 13805 SdHoareTripleChecker+Invalid, 8331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 7605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:34,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 13805 Invalid, 8331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 7605 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-13 23:58:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2022-07-13 23:58:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 4782. [2022-07-13 23:58:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 3862 states have (on average 1.4751424132573796) internal successors, (5697), 3893 states have internal predecessors, (5697), 753 states have call successors, (753), 168 states have call predecessors, (753), 166 states have return successors, (748), 748 states have call predecessors, (748), 744 states have call successors, (748) [2022-07-13 23:58:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 7198 transitions. [2022-07-13 23:58:34,397 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 7198 transitions. Word has length 78 [2022-07-13 23:58:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:34,397 INFO L495 AbstractCegarLoop]: Abstraction has 4782 states and 7198 transitions. [2022-07-13 23:58:34,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 23:58:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 7198 transitions. [2022-07-13 23:58:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 23:58:34,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:34,401 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:58:34,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 23:58:34,401 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1260357111, now seen corresponding path program 1 times [2022-07-13 23:58:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:34,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746754614] [2022-07-13 23:58:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 23:58:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 23:58:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:58:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 23:58:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:58:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 23:58:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 23:58:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:58:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 23:58:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:34,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746754614] [2022-07-13 23:58:34,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746754614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:34,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:34,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:58:34,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310943415] [2022-07-13 23:58:34,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:34,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:58:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:58:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:58:34,593 INFO L87 Difference]: Start difference. First operand 4782 states and 7198 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:58:38,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:58:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:43,091 INFO L93 Difference]: Finished difference Result 12026 states and 18584 transitions. [2022-07-13 23:58:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:58:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 82 [2022-07-13 23:58:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:43,123 INFO L225 Difference]: With dead ends: 12026 [2022-07-13 23:58:43,123 INFO L226 Difference]: Without dead ends: 7297 [2022-07-13 23:58:43,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:58:43,141 INFO L413 NwaCegarLoop]: 3799 mSDtfsCounter, 3750 mSDsluCounter, 6326 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 1634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4097 SdHoareTripleChecker+Valid, 10125 SdHoareTripleChecker+Invalid, 7619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1634 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:43,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4097 Valid, 10125 Invalid, 7619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1634 Valid, 5985 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-13 23:58:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7297 states. [2022-07-13 23:58:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7297 to 6511. [2022-07-13 23:58:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6511 states, 5310 states have (on average 1.4922787193973635) internal successors, (7924), 5340 states have internal predecessors, (7924), 1034 states have call successors, (1034), 168 states have call predecessors, (1034), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-07-13 23:58:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 9991 transitions. [2022-07-13 23:58:43,434 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 9991 transitions. Word has length 82 [2022-07-13 23:58:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:43,434 INFO L495 AbstractCegarLoop]: Abstraction has 6511 states and 9991 transitions. [2022-07-13 23:58:43,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 23:58:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 9991 transitions. [2022-07-13 23:58:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-13 23:58:43,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:43,440 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-13 23:58:43,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 23:58:43,441 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1025149567, now seen corresponding path program 1 times [2022-07-13 23:58:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:43,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201730485] [2022-07-13 23:58:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:58:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:58:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:58:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:58:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:58:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 23:58:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:58:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:58:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:58:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 23:58:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201730485] [2022-07-13 23:58:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201730485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:43,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:43,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:58:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039583573] [2022-07-13 23:58:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:43,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:58:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:58:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:58:43,646 INFO L87 Difference]: Start difference. First operand 6511 states and 9991 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 23:58:47,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:47,715 INFO L93 Difference]: Finished difference Result 6857 states and 10641 transitions. [2022-07-13 23:58:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 23:58:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2022-07-13 23:58:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:47,741 INFO L225 Difference]: With dead ends: 6857 [2022-07-13 23:58:47,741 INFO L226 Difference]: Without dead ends: 6854 [2022-07-13 23:58:47,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:58:47,744 INFO L413 NwaCegarLoop]: 3145 mSDtfsCounter, 2105 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 7263 SdHoareTripleChecker+Invalid, 4251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:47,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 7263 Invalid, 4251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-13 23:58:47,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2022-07-13 23:58:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6510. [2022-07-13 23:58:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 5310 states have (on average 1.4919020715630884) internal successors, (7922), 5339 states have internal predecessors, (7922), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-07-13 23:58:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 9988 transitions. [2022-07-13 23:58:48,004 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 9988 transitions. Word has length 81 [2022-07-13 23:58:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:48,005 INFO L495 AbstractCegarLoop]: Abstraction has 6510 states and 9988 transitions. [2022-07-13 23:58:48,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 23:58:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 9988 transitions. [2022-07-13 23:58:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-13 23:58:48,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:48,020 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:58:48,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 23:58:48,020 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:48,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:48,021 INFO L85 PathProgramCache]: Analyzing trace with hash -506086540, now seen corresponding path program 1 times [2022-07-13 23:58:48,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:48,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525757429] [2022-07-13 23:58:48,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:48,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:58:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:58:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:58:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:58:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:58:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 23:58:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:58:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:58:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:58:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:58:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 23:58:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:58:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 23:58:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:58:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:58:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:58:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 23:58:48,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525757429] [2022-07-13 23:58:48,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525757429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:48,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:48,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 23:58:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679044065] [2022-07-13 23:58:48,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:48,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:58:48,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:58:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:58:48,269 INFO L87 Difference]: Start difference. First operand 6510 states and 9988 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-13 23:58:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:58:54,852 INFO L93 Difference]: Finished difference Result 13459 states and 20861 transitions. [2022-07-13 23:58:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:58:54,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2022-07-13 23:58:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:58:54,883 INFO L225 Difference]: With dead ends: 13459 [2022-07-13 23:58:54,884 INFO L226 Difference]: Without dead ends: 6990 [2022-07-13 23:58:54,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:58:54,904 INFO L413 NwaCegarLoop]: 3069 mSDtfsCounter, 3902 mSDsluCounter, 7094 mSDsCounter, 0 mSdLazyCounter, 5800 mSolverCounterSat, 2098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3904 SdHoareTripleChecker+Valid, 10163 SdHoareTripleChecker+Invalid, 7898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2098 IncrementalHoareTripleChecker+Valid, 5800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:58:54,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3904 Valid, 10163 Invalid, 7898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2098 Valid, 5800 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-13 23:58:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2022-07-13 23:58:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6504. [2022-07-13 23:58:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6504 states, 5309 states have (on average 1.4912412883782256) internal successors, (7917), 5338 states have internal predecessors, (7917), 1028 states have call successors, (1028), 168 states have call predecessors, (1028), 166 states have return successors, (1028), 1028 states have call predecessors, (1028), 1020 states have call successors, (1028) [2022-07-13 23:58:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 9973 transitions. [2022-07-13 23:58:55,210 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 9973 transitions. Word has length 144 [2022-07-13 23:58:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:58:55,211 INFO L495 AbstractCegarLoop]: Abstraction has 6504 states and 9973 transitions. [2022-07-13 23:58:55,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-13 23:58:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 9973 transitions. [2022-07-13 23:58:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-13 23:58:55,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:58:55,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:58:55,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 23:58:55,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:58:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:58:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1900050381, now seen corresponding path program 1 times [2022-07-13 23:58:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:58:55,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792703795] [2022-07-13 23:58:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:58:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:58:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:58:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:58:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:58:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:58:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:58:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:58:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 23:58:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:58:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:58:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:58:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:58:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 23:58:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:58:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:58:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 23:58:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 23:58:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:58:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 23:58:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:58:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:58:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 23:58:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:58:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 23:58:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:58:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 23:58:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 23:58:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 23:58:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 23:58:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-13 23:58:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 23:58:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 23:58:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:58:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:58:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-13 23:58:55,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:58:55,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792703795] [2022-07-13 23:58:55,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792703795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:58:55,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:58:55,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 23:58:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145672] [2022-07-13 23:58:55,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:58:55,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 23:58:55,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:58:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 23:58:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:58:55,774 INFO L87 Difference]: Start difference. First operand 6504 states and 9973 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-13 23:59:01,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:59:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:08,383 INFO L93 Difference]: Finished difference Result 13716 states and 21377 transitions. [2022-07-13 23:59:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:59:08,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 239 [2022-07-13 23:59:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:08,427 INFO L225 Difference]: With dead ends: 13716 [2022-07-13 23:59:08,427 INFO L226 Difference]: Without dead ends: 7235 [2022-07-13 23:59:08,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-13 23:59:08,454 INFO L413 NwaCegarLoop]: 3032 mSDtfsCounter, 4753 mSDsluCounter, 9441 mSDsCounter, 0 mSdLazyCounter, 9926 mSolverCounterSat, 2706 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4789 SdHoareTripleChecker+Valid, 12473 SdHoareTripleChecker+Invalid, 12633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2706 IncrementalHoareTripleChecker+Valid, 9926 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:08,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4789 Valid, 12473 Invalid, 12633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2706 Valid, 9926 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2022-07-13 23:59:08,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7235 states. [2022-07-13 23:59:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7235 to 6512. [2022-07-13 23:59:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 5312 states have (on average 1.4890813253012047) internal successors, (7910), 5341 states have internal predecessors, (7910), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-07-13 23:59:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 9976 transitions. [2022-07-13 23:59:08,835 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 9976 transitions. Word has length 239 [2022-07-13 23:59:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:08,836 INFO L495 AbstractCegarLoop]: Abstraction has 6512 states and 9976 transitions. [2022-07-13 23:59:08,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-13 23:59:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 9976 transitions. [2022-07-13 23:59:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 23:59:08,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:08,859 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:08,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 23:59:08,860 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1106676286, now seen corresponding path program 1 times [2022-07-13 23:59:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:08,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804888954] [2022-07-13 23:59:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:59:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:59:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:59:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 23:59:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 23:59:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:59:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 23:59:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:59:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 23:59:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 23:59:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 23:59:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 23:59:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 23:59:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 23:59:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 23:59:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:59:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-13 23:59:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 23:59:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:59:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 23:59:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 23:59:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:59:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:59:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:59:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:59:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-13 23:59:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-13 23:59:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-13 23:59:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-13 23:59:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-13 23:59:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-13 23:59:09,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:09,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804888954] [2022-07-13 23:59:09,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804888954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:09,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:09,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 23:59:09,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828870872] [2022-07-13 23:59:09,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:09,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 23:59:09,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 23:59:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:59:09,336 INFO L87 Difference]: Start difference. First operand 6512 states and 9976 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 6 states have internal predecessors, (165), 4 states have call successors, (36), 9 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-13 23:59:16,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:59:18,697 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-13 23:59:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:28,725 INFO L93 Difference]: Finished difference Result 13890 states and 21920 transitions. [2022-07-13 23:59:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 23:59:28,726 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 6 states have internal predecessors, (165), 4 states have call successors, (36), 9 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 263 [2022-07-13 23:59:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:28,765 INFO L225 Difference]: With dead ends: 13890 [2022-07-13 23:59:28,765 INFO L226 Difference]: Without dead ends: 7394 [2022-07-13 23:59:28,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-07-13 23:59:28,795 INFO L413 NwaCegarLoop]: 3042 mSDtfsCounter, 4473 mSDsluCounter, 11930 mSDsCounter, 0 mSdLazyCounter, 13522 mSolverCounterSat, 2474 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 14972 SdHoareTripleChecker+Invalid, 15998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2474 IncrementalHoareTripleChecker+Valid, 13522 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:28,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 14972 Invalid, 15998 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2474 Valid, 13522 Invalid, 2 Unknown, 0 Unchecked, 18.6s Time] [2022-07-13 23:59:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2022-07-13 23:59:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 6576. [2022-07-13 23:59:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 5375 states have (on average 1.4852093023255815) internal successors, (7983), 5397 states have internal predecessors, (7983), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-07-13 23:59:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 10052 transitions. [2022-07-13 23:59:29,186 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 10052 transitions. Word has length 263 [2022-07-13 23:59:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:29,187 INFO L495 AbstractCegarLoop]: Abstraction has 6576 states and 10052 transitions. [2022-07-13 23:59:29,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 6 states have internal predecessors, (165), 4 states have call successors, (36), 9 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-13 23:59:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 10052 transitions. [2022-07-13 23:59:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-13 23:59:29,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:29,207 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:29,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 23:59:29,208 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2009801004, now seen corresponding path program 1 times [2022-07-13 23:59:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:29,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18528376] [2022-07-13 23:59:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:59:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:59:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:59:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:59:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:59:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:59:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 23:59:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:59:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:59:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:59:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:59:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 23:59:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:59:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:59:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 23:59:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 23:59:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:59:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 23:59:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 23:59:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:59:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:59:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:59:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:59:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:59:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 23:59:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-13 23:59:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 23:59:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 23:59:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-13 23:59:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 23:59:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18528376] [2022-07-13 23:59:29,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18528376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:29,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:29,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:59:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14742928] [2022-07-13 23:59:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:29,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:59:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:59:29,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:59:29,620 INFO L87 Difference]: Start difference. First operand 6576 states and 10052 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-13 23:59:34,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:59:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:41,339 INFO L93 Difference]: Finished difference Result 13892 states and 21612 transitions. [2022-07-13 23:59:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 23:59:41,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 249 [2022-07-13 23:59:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:41,365 INFO L225 Difference]: With dead ends: 13892 [2022-07-13 23:59:41,365 INFO L226 Difference]: Without dead ends: 7369 [2022-07-13 23:59:41,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-07-13 23:59:41,387 INFO L413 NwaCegarLoop]: 3010 mSDtfsCounter, 5166 mSDsluCounter, 6392 mSDsCounter, 0 mSdLazyCounter, 5867 mSolverCounterSat, 3099 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 9402 SdHoareTripleChecker+Invalid, 8967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3099 IncrementalHoareTripleChecker+Valid, 5867 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:41,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 9402 Invalid, 8967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3099 Valid, 5867 Invalid, 1 Unknown, 0 Unchecked, 11.2s Time] [2022-07-13 23:59:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7369 states. [2022-07-13 23:59:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7369 to 6580. [2022-07-13 23:59:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 5379 states have (on average 1.4848484848484849) internal successors, (7987), 5401 states have internal predecessors, (7987), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-07-13 23:59:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 10056 transitions. [2022-07-13 23:59:41,727 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 10056 transitions. Word has length 249 [2022-07-13 23:59:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:41,727 INFO L495 AbstractCegarLoop]: Abstraction has 6580 states and 10056 transitions. [2022-07-13 23:59:41,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-13 23:59:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 10056 transitions. [2022-07-13 23:59:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-13 23:59:41,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:41,749 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:41,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 23:59:41,750 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1493708136, now seen corresponding path program 1 times [2022-07-13 23:59:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:41,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241356558] [2022-07-13 23:59:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:41,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:59:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:59:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:59:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:59:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:59:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:59:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 23:59:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:59:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:59:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:59:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:59:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 23:59:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:59:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:59:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 23:59:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 23:59:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:59:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:41,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 23:59:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 23:59:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 23:59:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:59:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:59:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:59:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:59:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-13 23:59:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-13 23:59:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-13 23:59:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-13 23:59:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-13 23:59:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 23:59:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:42,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241356558] [2022-07-13 23:59:42,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241356558] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:59:42,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256358081] [2022-07-13 23:59:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:42,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:59:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:59:42,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:59:42,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 23:59:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:43,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 3534 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:59:43,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:59:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 23:59:43,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:59:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 23:59:43,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256358081] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:59:43,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:59:43,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-07-13 23:59:43,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393718817] [2022-07-13 23:59:43,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:59:43,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 23:59:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 23:59:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:59:43,612 INFO L87 Difference]: Start difference. First operand 6580 states and 10056 transitions. Second operand has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 9 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-13 23:59:49,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:59:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:59:56,765 INFO L93 Difference]: Finished difference Result 13916 states and 21644 transitions. [2022-07-13 23:59:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 23:59:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 9 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 251 [2022-07-13 23:59:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:59:56,793 INFO L225 Difference]: With dead ends: 13916 [2022-07-13 23:59:56,793 INFO L226 Difference]: Without dead ends: 7389 [2022-07-13 23:59:56,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-07-13 23:59:56,811 INFO L413 NwaCegarLoop]: 2996 mSDtfsCounter, 4782 mSDsluCounter, 8781 mSDsCounter, 0 mSdLazyCounter, 9244 mSolverCounterSat, 2714 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4784 SdHoareTripleChecker+Valid, 11777 SdHoareTripleChecker+Invalid, 11959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2714 IncrementalHoareTripleChecker+Valid, 9244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:59:56,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4784 Valid, 11777 Invalid, 11959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2714 Valid, 9244 Invalid, 1 Unknown, 0 Unchecked, 12.5s Time] [2022-07-13 23:59:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2022-07-13 23:59:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 6604. [2022-07-13 23:59:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 5403 states have (on average 1.4826947991856376) internal successors, (8011), 5425 states have internal predecessors, (8011), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-07-13 23:59:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 10080 transitions. [2022-07-13 23:59:57,141 INFO L78 Accepts]: Start accepts. Automaton has 6604 states and 10080 transitions. Word has length 251 [2022-07-13 23:59:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:59:57,142 INFO L495 AbstractCegarLoop]: Abstraction has 6604 states and 10080 transitions. [2022-07-13 23:59:57,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 9 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-13 23:59:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6604 states and 10080 transitions. [2022-07-13 23:59:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-13 23:59:57,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:59:57,169 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:59:57,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 23:59:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 23:59:57,395 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:59:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:59:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash 158230500, now seen corresponding path program 2 times [2022-07-13 23:59:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:59:57,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099756933] [2022-07-13 23:59:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:59:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:59:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:59:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:59:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 23:59:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:59:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:59:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 23:59:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 23:59:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:59:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:59:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 23:59:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 23:59:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 23:59:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 23:59:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 23:59:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 23:59:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 23:59:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:59:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 23:59:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 23:59:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:59:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 23:59:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 23:59:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 23:59:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:59:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 23:59:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-13 23:59:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-13 23:59:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-13 23:59:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:57,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-13 23:59:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:58,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:59:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:59:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-13 23:59:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:59:58,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099756933] [2022-07-13 23:59:58,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099756933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:59:58,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:59:58,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 23:59:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49147757] [2022-07-13 23:59:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:59:58,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 23:59:58,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:59:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 23:59:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:59:58,010 INFO L87 Difference]: Start difference. First operand 6604 states and 10080 transitions. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-14 00:00:04,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:06,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:15,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:24,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:26,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:00:30,400 INFO L93 Difference]: Finished difference Result 17791 states and 28156 transitions. [2022-07-14 00:00:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 00:00:30,401 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 257 [2022-07-14 00:00:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:00:30,458 INFO L225 Difference]: With dead ends: 17791 [2022-07-14 00:00:30,458 INFO L226 Difference]: Without dead ends: 11240 [2022-07-14 00:00:30,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2022-07-14 00:00:30,489 INFO L413 NwaCegarLoop]: 4556 mSDtfsCounter, 6024 mSDsluCounter, 21183 mSDsCounter, 0 mSdLazyCounter, 15246 mSolverCounterSat, 2679 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6276 SdHoareTripleChecker+Valid, 25739 SdHoareTripleChecker+Invalid, 17929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2679 IncrementalHoareTripleChecker+Valid, 15246 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:00:30,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6276 Valid, 25739 Invalid, 17929 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2679 Valid, 15246 Invalid, 4 Unknown, 0 Unchecked, 31.3s Time] [2022-07-14 00:00:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11240 states. [2022-07-14 00:00:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11240 to 6618. [2022-07-14 00:00:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6618 states, 5415 states have (on average 1.4816251154201292) internal successors, (8023), 5435 states have internal predecessors, (8023), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 169 states have return successors, (1041), 1037 states have call predecessors, (1041), 1025 states have call successors, (1041) [2022-07-14 00:00:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 10097 transitions. [2022-07-14 00:00:31,130 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 10097 transitions. Word has length 257 [2022-07-14 00:00:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:00:31,131 INFO L495 AbstractCegarLoop]: Abstraction has 6618 states and 10097 transitions. [2022-07-14 00:00:31,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-14 00:00:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 10097 transitions. [2022-07-14 00:00:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-07-14 00:00:31,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:00:31,147 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:00:31,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 00:00:31,148 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:00:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:00:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 735751408, now seen corresponding path program 1 times [2022-07-14 00:00:31,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:00:31,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676958991] [2022-07-14 00:00:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:00:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:00:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:00:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:00:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:00:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:00:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:00:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:00:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:00:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:00:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:00:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:00:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:00:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:00:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:00:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:00:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 00:00:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:00:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:00:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:00:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 00:00:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:00:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:00:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:00:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:00:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 00:00:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 00:00:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-14 00:00:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-14 00:00:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-14 00:00:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 00:00:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:00:31,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676958991] [2022-07-14 00:00:31,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676958991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:00:31,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:00:31,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 00:00:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355663590] [2022-07-14 00:00:31,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:00:31,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 00:00:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:00:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 00:00:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:00:31,716 INFO L87 Difference]: Start difference. First operand 6618 states and 10097 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-14 00:00:38,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:52,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:00:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:00:56,588 INFO L93 Difference]: Finished difference Result 11995 states and 19154 transitions. [2022-07-14 00:00:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 00:00:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 260 [2022-07-14 00:00:56,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:00:56,652 INFO L225 Difference]: With dead ends: 11995 [2022-07-14 00:00:56,653 INFO L226 Difference]: Without dead ends: 11069 [2022-07-14 00:00:56,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:00:56,666 INFO L413 NwaCegarLoop]: 4462 mSDtfsCounter, 6938 mSDsluCounter, 17923 mSDsCounter, 0 mSdLazyCounter, 12767 mSolverCounterSat, 3119 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6940 SdHoareTripleChecker+Valid, 22385 SdHoareTripleChecker+Invalid, 15888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3119 IncrementalHoareTripleChecker+Valid, 12767 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:00:56,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6940 Valid, 22385 Invalid, 15888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3119 Valid, 12767 Invalid, 2 Unknown, 0 Unchecked, 23.7s Time] [2022-07-14 00:00:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2022-07-14 00:00:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 6470. [2022-07-14 00:00:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6470 states, 5288 states have (on average 1.4784417549167927) internal successors, (7818), 5307 states have internal predecessors, (7818), 1013 states have call successors, (1013), 166 states have call predecessors, (1013), 168 states have return successors, (1022), 1018 states have call predecessors, (1022), 1006 states have call successors, (1022) [2022-07-14 00:00:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6470 states to 6470 states and 9853 transitions. [2022-07-14 00:00:57,172 INFO L78 Accepts]: Start accepts. Automaton has 6470 states and 9853 transitions. Word has length 260 [2022-07-14 00:00:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:00:57,182 INFO L495 AbstractCegarLoop]: Abstraction has 6470 states and 9853 transitions. [2022-07-14 00:00:57,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-14 00:00:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6470 states and 9853 transitions. [2022-07-14 00:00:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-07-14 00:00:57,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:00:57,213 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:00:57,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 00:00:57,213 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:00:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:00:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1715192008, now seen corresponding path program 1 times [2022-07-14 00:00:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:00:57,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887376852] [2022-07-14 00:00:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:00:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:00:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:00:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:00:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:00:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:00:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:00:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:00:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:00:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:00:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:00:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:00:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:00:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:00:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:00:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:00:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:00:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 00:00:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:00:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:00:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:00:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 00:00:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:00:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:00:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:00:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:00:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:00:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 00:00:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-14 00:00:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-14 00:00:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-14 00:00:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 00:00:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-14 00:00:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-14 00:00:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:00:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-14 00:00:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:00:57,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887376852] [2022-07-14 00:00:57,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887376852] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:00:57,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:00:57,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 00:00:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619087300] [2022-07-14 00:00:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:00:57,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 00:00:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:00:57,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 00:00:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:00:57,919 INFO L87 Difference]: Start difference. First operand 6470 states and 9853 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 00:01:07,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:09,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:25,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:27,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:01:32,656 INFO L93 Difference]: Finished difference Result 12992 states and 20609 transitions. [2022-07-14 00:01:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 00:01:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 266 [2022-07-14 00:01:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:01:32,754 INFO L225 Difference]: With dead ends: 12992 [2022-07-14 00:01:32,770 INFO L226 Difference]: Without dead ends: 11063 [2022-07-14 00:01:32,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-07-14 00:01:32,795 INFO L413 NwaCegarLoop]: 4461 mSDtfsCounter, 6913 mSDsluCounter, 19065 mSDsCounter, 0 mSdLazyCounter, 14922 mSolverCounterSat, 2770 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6915 SdHoareTripleChecker+Valid, 23526 SdHoareTripleChecker+Invalid, 17696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2770 IncrementalHoareTripleChecker+Valid, 14922 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:01:32,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6915 Valid, 23526 Invalid, 17696 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2770 Valid, 14922 Invalid, 4 Unknown, 0 Unchecked, 33.4s Time] [2022-07-14 00:01:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11063 states. [2022-07-14 00:01:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11063 to 6464. [2022-07-14 00:01:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 5284 states have (on average 1.4780469341408025) internal successors, (7810), 5303 states have internal predecessors, (7810), 1011 states have call successors, (1011), 166 states have call predecessors, (1011), 168 states have return successors, (1020), 1016 states have call predecessors, (1020), 1004 states have call successors, (1020) [2022-07-14 00:01:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 9841 transitions. [2022-07-14 00:01:33,575 INFO L78 Accepts]: Start accepts. Automaton has 6464 states and 9841 transitions. Word has length 266 [2022-07-14 00:01:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:01:33,593 INFO L495 AbstractCegarLoop]: Abstraction has 6464 states and 9841 transitions. [2022-07-14 00:01:33,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 00:01:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6464 states and 9841 transitions. [2022-07-14 00:01:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-14 00:01:33,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:01:33,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:01:33,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 00:01:33,631 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:01:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:01:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 885064232, now seen corresponding path program 1 times [2022-07-14 00:01:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:01:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631353550] [2022-07-14 00:01:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:01:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 00:01:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 00:01:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-14 00:01:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:01:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 00:01:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:01:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:01:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:01:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:01:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:01:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:01:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:01:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-14 00:01:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:01:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:01:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 00:01:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 00:01:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:01:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:01:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 00:01:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:01:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 00:01:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 00:01:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 00:01:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 00:01:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-14 00:01:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-14 00:01:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-14 00:01:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-14 00:01:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-14 00:01:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:01:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-14 00:01:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 00:01:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:01:34,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631353550] [2022-07-14 00:01:34,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631353550] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:01:34,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683763369] [2022-07-14 00:01:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:01:34,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:01:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:01:34,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:01:34,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:01:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:01:35,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 3744 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:01:35,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:01:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-14 00:01:35,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:01:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-14 00:01:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683763369] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:01:36,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:01:36,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 13 [2022-07-14 00:01:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500704388] [2022-07-14 00:01:36,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:01:36,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 00:01:36,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:01:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 00:01:36,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:01:36,297 INFO L87 Difference]: Start difference. First operand 6464 states and 9841 transitions. Second operand has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 5 states have internal predecessors, (253), 4 states have call successors, (73), 10 states have call predecessors, (73), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2022-07-14 00:01:44,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:01:47,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []