./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 73338d683e10a9827a18cf31e1247b64129367b1297cba22c91c243b4552d29d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:28:20,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:28:20,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:28:20,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:28:20,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:28:20,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:28:20,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:28:20,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:28:20,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:28:20,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:28:20,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:28:20,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:28:20,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:28:20,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:28:20,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:28:20,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:28:20,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:28:20,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:28:20,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:28:20,306 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:28:20,307 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:28:20,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:28:20,309 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:28:20,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:28:20,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:28:20,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:28:20,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:28:20,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:28:20,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:28:20,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:28:20,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:28:20,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:28:20,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:28:20,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:28:20,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:28:20,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:28:20,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:28:20,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:28:20,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:28:20,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:28:20,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:28:20,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:28:20,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:28:20,344 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:28:20,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:28:20,345 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:28:20,345 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:28:20,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:28:20,346 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:28:20,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:28:20,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:28:20,346 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:28:20,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:28:20,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:28:20,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:28:20,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:28:20,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:28:20,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:28:20,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:28:20,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:28:20,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:28:20,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:28:20,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:28:20,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:28:20,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:28:20,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:28:20,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:28:20,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:28:20,350 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:28:20,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:28:20,350 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:28:20,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:28:20,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:28:20,351 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 -> 73338d683e10a9827a18cf31e1247b64129367b1297cba22c91c243b4552d29d [2022-07-12 12:28:20,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:28:20,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:28:20,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:28:20,557 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:28:20,557 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:28:20,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-07-12 12:28:20,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ef2856e/5d38c1ee1efc4ff79489482a9b45ef2b/FLAGdcf29800d [2022-07-12 12:28:21,193 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:28:21,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-07-12 12:28:21,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ef2856e/5d38c1ee1efc4ff79489482a9b45ef2b/FLAGdcf29800d [2022-07-12 12:28:21,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ef2856e/5d38c1ee1efc4ff79489482a9b45ef2b [2022-07-12 12:28:21,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:28:21,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:28:21,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:28:21,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:28:21,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:28:21,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:28:21" (1/1) ... [2022-07-12 12:28:21,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a66a251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:21, skipping insertion in model container [2022-07-12 12:28:21,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:28:21" (1/1) ... [2022-07-12 12:28:21,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:28:21,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:28:22,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[116401,116414] [2022-07-12 12:28:22,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:28:22,740 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:28:22,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[116401,116414] [2022-07-12 12:28:22,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:28:23,093 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:28:23,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23 WrapperNode [2022-07-12 12:28:23,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:28:23,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:28:23,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:28:23,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:28:23,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,339 INFO L137 Inliner]: procedures = 245, calls = 3306, calls flagged for inlining = 118, calls inlined = 118, statements flattened = 6447 [2022-07-12 12:28:23,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:28:23,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:28:23,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:28:23,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:28:23,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:28:23,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:28:23,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:28:23,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:28:23,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (1/1) ... [2022-07-12 12:28:23,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:28:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:23,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 12:28:23,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 12:28:23,661 INFO L130 BoogieDeclarations]: Found specification of procedure acm_disconnect [2022-07-12 12:28:23,661 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_disconnect [2022-07-12 12:28:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_tty_hangup [2022-07-12 12:28:23,662 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_tty_hangup [2022-07-12 12:28:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_18 [2022-07-12 12:28:23,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_18 [2022-07-12 12:28:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:28:23,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:28:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:28:23,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:28:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure acm_port_destruct [2022-07-12 12:28:23,663 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_port_destruct [2022-07-12 12:28:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-12 12:28:23,663 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-12 12:28:23,663 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:28:23,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:28:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_22 [2022-07-12 12:28:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_22 [2022-07-12 12:28:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_cleanup [2022-07-12 12:28:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_cleanup [2022-07-12 12:28:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:28:23,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:28:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-07-12 12:28:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-07-12 12:28:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:28:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:28:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_buffers_free [2022-07-12 12:28:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_buffers_free [2022-07-12 12:28:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 12:28:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 12:28:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:28:23,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:28:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 12:28:23,666 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 12:28:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-12 12:28:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-12 12:28:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:28:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:28:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:28:23,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:28:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:28:23,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:28:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 12:28:23,668 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 12:28:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_put [2022-07-12 12:28:23,669 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_put [2022-07-12 12:28:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_chars_in_buffer [2022-07-12 12:28:23,669 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_chars_in_buffer [2022-07-12 12:28:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure acm_resume [2022-07-12 12:28:23,669 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_resume [2022-07-12 12:28:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:28:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 12:28:23,669 INFO L130 BoogieDeclarations]: Found specification of procedure acm_ctrl_msg [2022-07-12 12:28:23,670 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_ctrl_msg [2022-07-12 12:28:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-12 12:28:23,670 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-12 12:28:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:28:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_hangup [2022-07-12 12:28:23,671 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_hangup [2022-07-12 12:28:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-07-12 12:28:23,672 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-07-12 12:28:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-07-12 12:28:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 12:28:23,672 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 12:28:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2022-07-12 12:28:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2022-07-12 12:28:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:28:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:28:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 12:28:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 12:28:23,673 INFO L130 BoogieDeclarations]: Found specification of procedure put_tty_driver [2022-07-12 12:28:23,673 INFO L138 BoogieDeclarations]: Found implementation of procedure put_tty_driver [2022-07-12 12:28:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 12:28:23,674 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 12:28:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 12:28:23,674 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 12:28:23,674 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-12 12:28:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-12 12:28:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmget [2022-07-12 12:28:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmget [2022-07-12 12:28:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure acm_port_shutdown [2022-07-12 12:28:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_port_shutdown [2022-07-12 12:28:23,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2022-07-12 12:28:23,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2022-07-12 12:28:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_set_termios [2022-07-12 12:28:23,676 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_set_termios [2022-07-12 12:28:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:28:23,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:28:23,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:28:23,677 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-12 12:28:23,677 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-12 12:28:23,677 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_break_ctl [2022-07-12 12:28:23,678 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_break_ctl [2022-07-12 12:28:23,678 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 12:28:23,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 12:28:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:28:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_7 [2022-07-12 12:28:23,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_7 [2022-07-12 12:28:23,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2022-07-12 12:28:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2022-07-12 12:28:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2022-07-12 12:28:23,680 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2022-07-12 12:28:23,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:28:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure acm_start_wb [2022-07-12 12:28:23,681 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_start_wb [2022-07-12 12:28:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:28:23,681 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:28:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:28:23,681 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:28:23,681 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:28:23,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:28:23,682 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_throttle [2022-07-12 12:28:23,682 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_throttle [2022-07-12 12:28:23,682 INFO L130 BoogieDeclarations]: Found specification of procedure acm_wb_is_avail [2022-07-12 12:28:23,682 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_wb_is_avail [2022-07-12 12:28:23,682 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 12:28:23,683 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 12:28:23,683 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:28:23,684 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:28:23,685 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_write_room [2022-07-12 12:28:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_write_room [2022-07-12 12:28:23,686 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urb [2022-07-12 12:28:23,686 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urb [2022-07-12 12:28:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:28:23,688 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:28:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:28:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_done [2022-07-12 12:28:23,688 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_done [2022-07-12 12:28:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_ioctl [2022-07-12 12:28:23,692 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_ioctl [2022-07-12 12:28:23,692 INFO L130 BoogieDeclarations]: Found specification of procedure acm_release_minor [2022-07-12 12:28:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_release_minor [2022-07-12 12:28:23,693 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-12 12:28:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-12 12:28:23,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:28:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:28:23,693 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-07-12 12:28:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-07-12 12:28:23,693 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_unthrottle [2022-07-12 12:28:23,693 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_unthrottle [2022-07-12 12:28:23,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:28:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_3 [2022-07-12 12:28:23,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_3 [2022-07-12 12:28:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:28:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:28:23,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:28:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:28:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_17 [2022-07-12 12:28:23,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_17 [2022-07-12 12:28:23,694 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:28:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:28:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-12 12:28:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-12 12:28:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-12 12:28:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-12 12:28:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure acm_read_buffers_free [2022-07-12 12:28:23,695 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_read_buffers_free [2022-07-12 12:28:23,695 INFO L130 BoogieDeclarations]: Found specification of procedure acm_ctrl_irq [2022-07-12 12:28:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_ctrl_irq [2022-07-12 12:28:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urbs [2022-07-12 12:28:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urbs [2022-07-12 12:28:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_install [2022-07-12 12:28:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_install [2022-07-12 12:28:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure stop_data_traffic [2022-07-12 12:28:23,696 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_data_traffic [2022-07-12 12:28:23,696 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 12:28:23,697 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 12:28:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:28:23,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:28:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:28:23,697 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 12:28:23,697 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 12:28:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-12 12:28:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-12 12:28:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmset [2022-07-12 12:28:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmset [2022-07-12 12:28:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:28:23,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:28:23,698 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unregister_driver [2022-07-12 12:28:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unregister_driver [2022-07-12 12:28:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure acm_read_bulk_callback [2022-07-12 12:28:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_read_bulk_callback [2022-07-12 12:28:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 12:28:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 12:28:24,285 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:28:24,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:28:24,413 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:28:24,770 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:28:30,154 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:28:30,176 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:28:30,176 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 12:28:30,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:28:30 BoogieIcfgContainer [2022-07-12 12:28:30,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:28:30,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:28:30,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:28:30,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:28:30,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:28:21" (1/3) ... [2022-07-12 12:28:30,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b7d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:28:30, skipping insertion in model container [2022-07-12 12:28:30,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:28:23" (2/3) ... [2022-07-12 12:28:30,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b7d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:28:30, skipping insertion in model container [2022-07-12 12:28:30,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:28:30" (3/3) ... [2022-07-12 12:28:30,187 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-07-12 12:28:30,197 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:28:30,197 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:28:30,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:28:30,291 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@7a3c154, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22e6bd47 [2022-07-12 12:28:30,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:28:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 1511 states, 1082 states have (on average 1.353974121996303) internal successors, (1465), 1118 states have internal predecessors, (1465), 346 states have call successors, (346), 83 states have call predecessors, (346), 81 states have return successors, (335), 327 states have call predecessors, (335), 335 states have call successors, (335) [2022-07-12 12:28:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 12:28:30,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:30,328 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:30,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash -732994457, now seen corresponding path program 1 times [2022-07-12 12:28:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:30,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738036702] [2022-07-12 12:28:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:30,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:28:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:28:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:28:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:28:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:28:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:28:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:28:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:28:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:28:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:28:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:28:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:28:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 12:28:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:28:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:28:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:31,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738036702] [2022-07-12 12:28:31,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738036702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:31,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:31,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:28:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097923092] [2022-07-12 12:28:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:31,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:28:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:28:31,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:28:31,093 INFO L87 Difference]: Start difference. First operand has 1511 states, 1082 states have (on average 1.353974121996303) internal successors, (1465), 1118 states have internal predecessors, (1465), 346 states have call successors, (346), 83 states have call predecessors, (346), 81 states have return successors, (335), 327 states have call predecessors, (335), 335 states have call successors, (335) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:28:33,980 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:28:36,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:28:38,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:28:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:43,438 INFO L93 Difference]: Finished difference Result 4625 states and 6784 transitions. [2022-07-12 12:28:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:28:43,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 117 [2022-07-12 12:28:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:43,486 INFO L225 Difference]: With dead ends: 4625 [2022-07-12 12:28:43,488 INFO L226 Difference]: Without dead ends: 3085 [2022-07-12 12:28:43,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:28:43,505 INFO L413 NwaCegarLoop]: 2301 mSDtfsCounter, 3042 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 1664 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 5875 SdHoareTripleChecker+Invalid, 3997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1664 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:43,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3296 Valid, 5875 Invalid, 3997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1664 Valid, 2330 Invalid, 3 Unknown, 0 Unchecked, 12.0s Time] [2022-07-12 12:28:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-07-12 12:28:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2898. [2022-07-12 12:28:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2099 states have (on average 1.3392091472129586) internal successors, (2811), 2140 states have internal predecessors, (2811), 638 states have call successors, (638), 161 states have call predecessors, (638), 160 states have return successors, (632), 616 states have call predecessors, (632), 632 states have call successors, (632) [2022-07-12 12:28:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4081 transitions. [2022-07-12 12:28:43,750 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4081 transitions. Word has length 117 [2022-07-12 12:28:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:43,752 INFO L495 AbstractCegarLoop]: Abstraction has 2898 states and 4081 transitions. [2022-07-12 12:28:43,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 12:28:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4081 transitions. [2022-07-12 12:28:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 12:28:43,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:43,762 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:43,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:28:43,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 432030469, now seen corresponding path program 1 times [2022-07-12 12:28:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:43,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841028568] [2022-07-12 12:28:43,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:28:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:28:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:28:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:28:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:28:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:28:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:28:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:28:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:28:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:28:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:28:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:28:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:28:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:28:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:28:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:44,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841028568] [2022-07-12 12:28:44,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841028568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:44,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:44,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:28:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193895140] [2022-07-12 12:28:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:44,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:28:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:28:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:28:44,245 INFO L87 Difference]: Start difference. First operand 2898 states and 4081 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:28:47,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:28:49,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:28:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:55,778 INFO L93 Difference]: Finished difference Result 9211 states and 13363 transitions. [2022-07-12 12:28:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:28:55,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2022-07-12 12:28:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:55,803 INFO L225 Difference]: With dead ends: 9211 [2022-07-12 12:28:55,804 INFO L226 Difference]: Without dead ends: 6346 [2022-07-12 12:28:55,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:28:55,813 INFO L413 NwaCegarLoop]: 2381 mSDtfsCounter, 3218 mSDsluCounter, 4799 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 1802 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3471 SdHoareTripleChecker+Valid, 7180 SdHoareTripleChecker+Invalid, 5117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1802 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:55,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3471 Valid, 7180 Invalid, 5117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1802 Valid, 3313 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2022-07-12 12:28:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6346 states. [2022-07-12 12:28:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6346 to 5859. [2022-07-12 12:28:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 4247 states have (on average 1.3376501059571462) internal successors, (5681), 4330 states have internal predecessors, (5681), 1273 states have call successors, (1273), 321 states have call predecessors, (1273), 338 states have return successors, (1387), 1251 states have call predecessors, (1387), 1267 states have call successors, (1387) [2022-07-12 12:28:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 8341 transitions. [2022-07-12 12:28:55,989 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 8341 transitions. Word has length 129 [2022-07-12 12:28:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:55,991 INFO L495 AbstractCegarLoop]: Abstraction has 5859 states and 8341 transitions. [2022-07-12 12:28:55,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:28:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 8341 transitions. [2022-07-12 12:28:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 12:28:55,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:55,995 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:55,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:28:55,995 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash 507342559, now seen corresponding path program 1 times [2022-07-12 12:28:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:55,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303024548] [2022-07-12 12:28:55,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:28:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:28:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:28:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:28:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:28:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:28:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:28:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:28:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:28:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:28:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:28:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:28:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:28:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:28:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:28:56,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:56,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303024548] [2022-07-12 12:28:56,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303024548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:56,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:56,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:28:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524799231] [2022-07-12 12:28:56,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:56,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:28:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:56,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:28:56,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:28:56,379 INFO L87 Difference]: Start difference. First operand 5859 states and 8341 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:28:59,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:02,119 INFO L93 Difference]: Finished difference Result 6337 states and 9175 transitions. [2022-07-12 12:29:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:29:02,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2022-07-12 12:29:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:02,146 INFO L225 Difference]: With dead ends: 6337 [2022-07-12 12:29:02,146 INFO L226 Difference]: Without dead ends: 6334 [2022-07-12 12:29:02,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:02,151 INFO L413 NwaCegarLoop]: 1975 mSDtfsCounter, 2781 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 1403 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3029 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1403 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:02,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3029 Valid, 4050 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1403 Valid, 1157 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 12:29:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6334 states. [2022-07-12 12:29:02,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6334 to 5858. [2022-07-12 12:29:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 4247 states have (on average 1.337414645632211) internal successors, (5680), 4329 states have internal predecessors, (5680), 1272 states have call successors, (1272), 321 states have call predecessors, (1272), 338 states have return successors, (1387), 1251 states have call predecessors, (1387), 1267 states have call successors, (1387) [2022-07-12 12:29:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 8339 transitions. [2022-07-12 12:29:02,357 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 8339 transitions. Word has length 130 [2022-07-12 12:29:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:02,357 INFO L495 AbstractCegarLoop]: Abstraction has 5858 states and 8339 transitions. [2022-07-12 12:29:02,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 8339 transitions. [2022-07-12 12:29:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 12:29:02,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:02,361 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:02,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:29:02,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1452945080, now seen corresponding path program 1 times [2022-07-12 12:29:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:02,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475745133] [2022-07-12 12:29:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:29:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:29:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:29:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:29:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:29:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:29:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:29:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:29:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:29:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:29:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:29:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:29:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:29:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:02,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475745133] [2022-07-12 12:29:02,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475745133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:02,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:02,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:29:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398701874] [2022-07-12 12:29:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:29:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:29:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:29:02,668 INFO L87 Difference]: Start difference. First operand 5858 states and 8339 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, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:05,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:08,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:11,606 INFO L93 Difference]: Finished difference Result 6336 states and 9173 transitions. [2022-07-12 12:29:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:29:11,607 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, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2022-07-12 12:29:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:11,630 INFO L225 Difference]: With dead ends: 6336 [2022-07-12 12:29:11,631 INFO L226 Difference]: Without dead ends: 6333 [2022-07-12 12:29:11,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:11,635 INFO L413 NwaCegarLoop]: 1966 mSDtfsCounter, 2510 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 1042 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1042 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:11,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2756 Valid, 4956 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1042 Valid, 1694 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-07-12 12:29:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6333 states. [2022-07-12 12:29:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6333 to 5857. [2022-07-12 12:29:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5857 states, 4247 states have (on average 1.3371791853072756) internal successors, (5679), 4328 states have internal predecessors, (5679), 1271 states have call successors, (1271), 321 states have call predecessors, (1271), 338 states have return successors, (1387), 1251 states have call predecessors, (1387), 1267 states have call successors, (1387) [2022-07-12 12:29:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5857 states to 5857 states and 8337 transitions. [2022-07-12 12:29:11,823 INFO L78 Accepts]: Start accepts. Automaton has 5857 states and 8337 transitions. Word has length 131 [2022-07-12 12:29:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:11,824 INFO L495 AbstractCegarLoop]: Abstraction has 5857 states and 8337 transitions. [2022-07-12 12:29:11,824 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, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5857 states and 8337 transitions. [2022-07-12 12:29:11,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 12:29:11,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:11,828 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:29:11,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:11,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2092314878, now seen corresponding path program 1 times [2022-07-12 12:29:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:11,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052066533] [2022-07-12 12:29:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:29:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:29:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:29:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:29:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:29:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:29:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:29:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:29:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:29:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:29:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:29:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:29:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:29:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:12,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052066533] [2022-07-12 12:29:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052066533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:12,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:12,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:29:12,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674359960] [2022-07-12 12:29:12,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:12,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:29:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:29:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:29:12,199 INFO L87 Difference]: Start difference. First operand 5857 states and 8337 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:16,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:18,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:23,580 INFO L93 Difference]: Finished difference Result 18386 states and 26825 transitions. [2022-07-12 12:29:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:29:23,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 132 [2022-07-12 12:29:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:23,627 INFO L225 Difference]: With dead ends: 18386 [2022-07-12 12:29:23,627 INFO L226 Difference]: Without dead ends: 12562 [2022-07-12 12:29:23,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:29:23,648 INFO L413 NwaCegarLoop]: 2485 mSDtfsCounter, 3031 mSDsluCounter, 5040 mSDsCounter, 0 mSdLazyCounter, 3280 mSolverCounterSat, 1697 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3286 SdHoareTripleChecker+Valid, 7525 SdHoareTripleChecker+Invalid, 4979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 3280 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:23,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3286 Valid, 7525 Invalid, 4979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1697 Valid, 3280 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2022-07-12 12:29:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12562 states. [2022-07-12 12:29:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12562 to 11696. [2022-07-12 12:29:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11696 states, 8493 states have (on average 1.3380430943129635) internal successors, (11364), 8663 states have internal predecessors, (11364), 2512 states have call successors, (2512), 638 states have call predecessors, (2512), 690 states have return successors, (2955), 2486 states have call predecessors, (2955), 2505 states have call successors, (2955) [2022-07-12 12:29:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11696 states to 11696 states and 16831 transitions. [2022-07-12 12:29:24,045 INFO L78 Accepts]: Start accepts. Automaton has 11696 states and 16831 transitions. Word has length 132 [2022-07-12 12:29:24,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:24,045 INFO L495 AbstractCegarLoop]: Abstraction has 11696 states and 16831 transitions. [2022-07-12 12:29:24,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:24,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11696 states and 16831 transitions. [2022-07-12 12:29:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 12:29:24,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:24,049 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:24,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:29:24,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:24,050 INFO L85 PathProgramCache]: Analyzing trace with hash -437937269, now seen corresponding path program 1 times [2022-07-12 12:29:24,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:24,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493901483] [2022-07-12 12:29:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:29:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:29:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:29:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:29:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:29:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:29:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:29:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:29:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:29:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:29:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:29:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:29:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-12 12:29:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:24,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493901483] [2022-07-12 12:29:24,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493901483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:24,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:24,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:29:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795246167] [2022-07-12 12:29:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:24,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:29:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:29:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:29:24,328 INFO L87 Difference]: Start difference. First operand 11696 states and 16831 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:28,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:30,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:33,456 INFO L93 Difference]: Finished difference Result 12542 states and 18323 transitions. [2022-07-12 12:29:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:29:33,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2022-07-12 12:29:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:33,503 INFO L225 Difference]: With dead ends: 12542 [2022-07-12 12:29:33,504 INFO L226 Difference]: Without dead ends: 12521 [2022-07-12 12:29:33,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:29:33,514 INFO L413 NwaCegarLoop]: 1969 mSDtfsCounter, 2490 mSDsluCounter, 3023 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 1028 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 4992 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1028 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:33,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 4992 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1028 Valid, 1703 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2022-07-12 12:29:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12521 states. [2022-07-12 12:29:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12521 to 11677. [2022-07-12 12:29:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11677 states, 8479 states have (on average 1.3380115579667413) internal successors, (11345), 8648 states have internal predecessors, (11345), 2509 states have call successors, (2509), 636 states have call predecessors, (2509), 688 states have return successors, (2953), 2484 states have call predecessors, (2953), 2503 states have call successors, (2953) [2022-07-12 12:29:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11677 states to 11677 states and 16807 transitions. [2022-07-12 12:29:33,929 INFO L78 Accepts]: Start accepts. Automaton has 11677 states and 16807 transitions. Word has length 133 [2022-07-12 12:29:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:33,929 INFO L495 AbstractCegarLoop]: Abstraction has 11677 states and 16807 transitions. [2022-07-12 12:29:33,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 12:29:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 11677 states and 16807 transitions. [2022-07-12 12:29:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 12:29:33,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:33,935 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:33,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:29:33,935 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash 419378913, now seen corresponding path program 1 times [2022-07-12 12:29:33,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:33,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314881501] [2022-07-12 12:29:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:33,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:29:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:29:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:29:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:29:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:29:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:29:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:29:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:29:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:29:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:29:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:29:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 12:29:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 12:29:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 12:29:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 12:29:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-12 12:29:34,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:34,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314881501] [2022-07-12 12:29:34,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314881501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:34,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:34,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:29:34,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918106155] [2022-07-12 12:29:34,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:34,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:29:34,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:34,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:29:34,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:29:34,311 INFO L87 Difference]: Start difference. First operand 11677 states and 16807 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 12:29:37,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:39,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:42,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:44,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:46,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:29:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:54,713 INFO L93 Difference]: Finished difference Result 37229 states and 54433 transitions. [2022-07-12 12:29:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 12:29:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2022-07-12 12:29:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:54,845 INFO L225 Difference]: With dead ends: 37229 [2022-07-12 12:29:54,845 INFO L226 Difference]: Without dead ends: 25585 [2022-07-12 12:29:54,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:29:54,875 INFO L413 NwaCegarLoop]: 2096 mSDtfsCounter, 3539 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 1530 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3869 SdHoareTripleChecker+Valid, 6223 SdHoareTripleChecker+Invalid, 6795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1530 IncrementalHoareTripleChecker+Valid, 5260 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:54,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3869 Valid, 6223 Invalid, 6795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1530 Valid, 5260 Invalid, 5 Unknown, 0 Unchecked, 19.6s Time] [2022-07-12 12:29:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25585 states. [2022-07-12 12:29:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25585 to 23267. [2022-07-12 12:29:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23267 states, 16893 states have (on average 1.3353460013023146) internal successors, (22558), 17268 states have internal predecessors, (22558), 4914 states have call successors, (4914), 1261 states have call predecessors, (4914), 1459 states have return successors, (6142), 4929 states have call predecessors, (6142), 4908 states have call successors, (6142) [2022-07-12 12:29:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23267 states to 23267 states and 33614 transitions. [2022-07-12 12:29:55,739 INFO L78 Accepts]: Start accepts. Automaton has 23267 states and 33614 transitions. Word has length 154 [2022-07-12 12:29:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:55,740 INFO L495 AbstractCegarLoop]: Abstraction has 23267 states and 33614 transitions. [2022-07-12 12:29:55,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 12:29:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23267 states and 33614 transitions. [2022-07-12 12:29:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 12:29:55,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:55,751 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-07-12 12:29:55,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:29:55,752 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:55,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:55,752 INFO L85 PathProgramCache]: Analyzing trace with hash 401879852, now seen corresponding path program 1 times [2022-07-12 12:29:55,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:55,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402029904] [2022-07-12 12:29:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:55,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:29:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:29:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:29:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:29:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:29:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:29:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:29:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:29:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:29:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:29:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:29:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:29:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:29:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:29:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 12:29:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 12:29:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 12:29:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:29:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 12:29:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:29:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 12:29:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-07-12 12:29:56,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:56,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402029904] [2022-07-12 12:29:56,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402029904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:56,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:56,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:29:56,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363749868] [2022-07-12 12:29:56,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:56,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:29:56,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:56,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:29:56,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:29:56,150 INFO L87 Difference]: Start difference. First operand 23267 states and 33614 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 12:29:58,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:09,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:09,151 INFO L93 Difference]: Finished difference Result 66836 states and 96836 transitions. [2022-07-12 12:30:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:30:09,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 213 [2022-07-12 12:30:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:09,301 INFO L225 Difference]: With dead ends: 66836 [2022-07-12 12:30:09,302 INFO L226 Difference]: Without dead ends: 43612 [2022-07-12 12:30:09,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:30:09,364 INFO L413 NwaCegarLoop]: 2359 mSDtfsCounter, 2982 mSDsluCounter, 4491 mSDsCounter, 0 mSdLazyCounter, 5251 mSolverCounterSat, 1783 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3262 SdHoareTripleChecker+Valid, 6850 SdHoareTripleChecker+Invalid, 7035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1783 IncrementalHoareTripleChecker+Valid, 5251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:09,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3262 Valid, 6850 Invalid, 7035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1783 Valid, 5251 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2022-07-12 12:30:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43612 states. [2022-07-12 12:30:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43612 to 40727. [2022-07-12 12:30:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40727 states, 29352 states have (on average 1.3204551648950669) internal successors, (38758), 30087 states have internal predecessors, (38758), 8654 states have call successors, (8654), 2322 states have call predecessors, (8654), 2720 states have return successors, (10996), 8685 states have call predecessors, (10996), 8648 states have call successors, (10996) [2022-07-12 12:30:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40727 states to 40727 states and 58408 transitions. [2022-07-12 12:30:10,982 INFO L78 Accepts]: Start accepts. Automaton has 40727 states and 58408 transitions. Word has length 213 [2022-07-12 12:30:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:10,983 INFO L495 AbstractCegarLoop]: Abstraction has 40727 states and 58408 transitions. [2022-07-12 12:30:10,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 12:30:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 40727 states and 58408 transitions. [2022-07-12 12:30:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 12:30:10,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:10,997 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-07-12 12:30:10,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:30:10,997 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1742817952, now seen corresponding path program 1 times [2022-07-12 12:30:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:10,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131535381] [2022-07-12 12:30:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:30:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:30:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:30:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:30:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:30:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:30:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:30:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:30:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:30:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:30:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:30:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 12:30:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 12:30:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 12:30:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 12:30:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 12:30:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 12:30:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 12:30:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 12:30:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-07-12 12:30:11,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131535381] [2022-07-12 12:30:11,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131535381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:11,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:11,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:30:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264224731] [2022-07-12 12:30:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:11,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:30:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:11,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:30:11,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:30:11,521 INFO L87 Difference]: Start difference. First operand 40727 states and 58408 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 12:30:13,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:15,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:24,772 INFO L93 Difference]: Finished difference Result 86177 states and 125263 transitions. [2022-07-12 12:30:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:30:24,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 206 [2022-07-12 12:30:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:24,937 INFO L225 Difference]: With dead ends: 86177 [2022-07-12 12:30:24,937 INFO L226 Difference]: Without dead ends: 45485 [2022-07-12 12:30:25,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:30:25,037 INFO L413 NwaCegarLoop]: 1921 mSDtfsCounter, 1112 mSDsluCounter, 5484 mSDsCounter, 0 mSdLazyCounter, 4994 mSolverCounterSat, 642 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 7405 SdHoareTripleChecker+Invalid, 5638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 4994 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:25,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 7405 Invalid, 5638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 4994 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2022-07-12 12:30:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45485 states. [2022-07-12 12:30:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45485 to 40736. [2022-07-12 12:30:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40736 states, 29361 states have (on average 1.3202207009298048) internal successors, (38763), 30096 states have internal predecessors, (38763), 8654 states have call successors, (8654), 2322 states have call predecessors, (8654), 2720 states have return successors, (10996), 8685 states have call predecessors, (10996), 8648 states have call successors, (10996) [2022-07-12 12:30:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40736 states to 40736 states and 58413 transitions. [2022-07-12 12:30:26,656 INFO L78 Accepts]: Start accepts. Automaton has 40736 states and 58413 transitions. Word has length 206 [2022-07-12 12:30:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:26,656 INFO L495 AbstractCegarLoop]: Abstraction has 40736 states and 58413 transitions. [2022-07-12 12:30:26,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 12:30:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 40736 states and 58413 transitions. [2022-07-12 12:30:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 12:30:26,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:26,670 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-07-12 12:30:26,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:30:26,670 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2061724804, now seen corresponding path program 1 times [2022-07-12 12:30:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667667112] [2022-07-12 12:30:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:30:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:30:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:30:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:30:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:30:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:30:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:30:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:30:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:30:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:30:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 12:30:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 12:30:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 12:30:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 12:30:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 12:30:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 12:30:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 12:30:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:26,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 12:30:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:30:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 12:30:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-07-12 12:30:27,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667667112] [2022-07-12 12:30:27,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667667112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:27,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:27,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:30:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539626727] [2022-07-12 12:30:27,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:27,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:30:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:30:27,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:30:27,014 INFO L87 Difference]: Start difference. First operand 40736 states and 58413 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 12:30:29,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:38,437 INFO L93 Difference]: Finished difference Result 107390 states and 154137 transitions. [2022-07-12 12:30:38,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:30:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 215 [2022-07-12 12:30:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:38,633 INFO L225 Difference]: With dead ends: 107390 [2022-07-12 12:30:38,633 INFO L226 Difference]: Without dead ends: 66701 [2022-07-12 12:30:38,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:30:38,719 INFO L413 NwaCegarLoop]: 2122 mSDtfsCounter, 3584 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 3709 mSolverCounterSat, 2455 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3793 SdHoareTripleChecker+Valid, 5627 SdHoareTripleChecker+Invalid, 6165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2455 IncrementalHoareTripleChecker+Valid, 3709 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:38,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3793 Valid, 5627 Invalid, 6165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2455 Valid, 3709 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2022-07-12 12:30:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66701 states. [2022-07-12 12:30:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66701 to 61984. [2022-07-12 12:30:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61984 states, 44853 states have (on average 1.3191090896929971) internal successors, (59166), 45972 states have internal predecessors, (59166), 12711 states have call successors, (12711), 3777 states have call predecessors, (12711), 4419 states have return successors, (16205), 12722 states have call predecessors, (16205), 12705 states have call successors, (16205) [2022-07-12 12:30:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61984 states to 61984 states and 88082 transitions. [2022-07-12 12:30:41,006 INFO L78 Accepts]: Start accepts. Automaton has 61984 states and 88082 transitions. Word has length 215 [2022-07-12 12:30:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:41,007 INFO L495 AbstractCegarLoop]: Abstraction has 61984 states and 88082 transitions. [2022-07-12 12:30:41,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 12:30:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 61984 states and 88082 transitions. [2022-07-12 12:30:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 12:30:41,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:41,024 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-07-12 12:30:41,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 12:30:41,024 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1813652058, now seen corresponding path program 1 times [2022-07-12 12:30:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:30:41,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839546729] [2022-07-12 12:30:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:30:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:30:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:30:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:30:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:30:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:30:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:30:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:30:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:30:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:30:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:30:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:30:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:30:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:30:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:30:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:30:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:30:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:30:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:30:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:30:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 12:30:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:30:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 12:30:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:30:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 12:30:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:30:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:30:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:30:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-07-12 12:30:41,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:30:41,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839546729] [2022-07-12 12:30:41,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839546729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:41,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:41,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 12:30:41,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868308841] [2022-07-12 12:30:41,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:41,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 12:30:41,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:30:41,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 12:30:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:30:41,578 INFO L87 Difference]: Start difference. First operand 61984 states and 88082 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:30:43,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:47,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:56,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:30:59,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:04,632 INFO L93 Difference]: Finished difference Result 148009 states and 221643 transitions. [2022-07-12 12:31:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 12:31:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 214 [2022-07-12 12:31:04,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:05,035 INFO L225 Difference]: With dead ends: 148009 [2022-07-12 12:31:05,035 INFO L226 Difference]: Without dead ends: 107911 [2022-07-12 12:31:05,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-07-12 12:31:05,137 INFO L413 NwaCegarLoop]: 3845 mSDtfsCounter, 3467 mSDsluCounter, 18136 mSDsCounter, 0 mSdLazyCounter, 9383 mSolverCounterSat, 2558 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 21981 SdHoareTripleChecker+Invalid, 11945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2558 IncrementalHoareTripleChecker+Valid, 9383 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:05,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 21981 Invalid, 11945 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2558 Valid, 9383 Invalid, 4 Unknown, 0 Unchecked, 19.8s Time] [2022-07-12 12:31:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107911 states. [2022-07-12 12:31:07,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107911 to 60089. [2022-07-12 12:31:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60089 states, 43546 states have (on average 1.3201442153125431) internal successors, (57487), 44583 states have internal predecessors, (57487), 12308 states have call successors, (12308), 3644 states have call predecessors, (12308), 4234 states have return successors, (15520), 12337 states have call predecessors, (15520), 12304 states have call successors, (15520) [2022-07-12 12:31:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60089 states to 60089 states and 85315 transitions. [2022-07-12 12:31:08,179 INFO L78 Accepts]: Start accepts. Automaton has 60089 states and 85315 transitions. Word has length 214 [2022-07-12 12:31:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:08,180 INFO L495 AbstractCegarLoop]: Abstraction has 60089 states and 85315 transitions. [2022-07-12 12:31:08,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (31), 7 states have call predecessors, (31), 2 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 12:31:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 60089 states and 85315 transitions. [2022-07-12 12:31:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-12 12:31:08,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:08,196 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:31:08,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:31:08,197 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:08,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1754366035, now seen corresponding path program 1 times [2022-07-12 12:31:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:08,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087788573] [2022-07-12 12:31:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:08,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:31:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:31:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:31:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:31:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:31:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:31:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:31:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:31:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:31:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:31:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:31:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:31:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:31:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:31:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 12:31:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:31:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 12:31:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 12:31:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 12:31:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 12:31:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:31:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-12 12:31:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-07-12 12:31:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:08,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087788573] [2022-07-12 12:31:08,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087788573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:08,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:08,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:31:08,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270727920] [2022-07-12 12:31:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:08,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:31:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:08,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:31:08,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:31:08,563 INFO L87 Difference]: Start difference. First operand 60089 states and 85315 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 12:31:10,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:12,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:16,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:31:28,360 INFO L93 Difference]: Finished difference Result 157473 states and 225839 transitions. [2022-07-12 12:31:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 12:31:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 222 [2022-07-12 12:31:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:31:28,680 INFO L225 Difference]: With dead ends: 157473 [2022-07-12 12:31:28,681 INFO L226 Difference]: Without dead ends: 97443 [2022-07-12 12:31:28,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-12 12:31:28,821 INFO L413 NwaCegarLoop]: 2855 mSDtfsCounter, 4162 mSDsluCounter, 6030 mSDsCounter, 0 mSdLazyCounter, 5432 mSolverCounterSat, 2601 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4451 SdHoareTripleChecker+Valid, 8885 SdHoareTripleChecker+Invalid, 8036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2601 IncrementalHoareTripleChecker+Valid, 5432 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:31:28,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4451 Valid, 8885 Invalid, 8036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2601 Valid, 5432 Invalid, 3 Unknown, 0 Unchecked, 16.4s Time] [2022-07-12 12:31:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97443 states. [2022-07-12 12:31:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97443 to 88765. [2022-07-12 12:31:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88765 states, 64446 states have (on average 1.3205939856624151) internal successors, (85107), 65979 states have internal predecessors, (85107), 18048 states have call successors, (18048), 5392 states have call predecessors, (18048), 6270 states have return successors, (22768), 18101 states have call predecessors, (22768), 18044 states have call successors, (22768) [2022-07-12 12:31:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88765 states to 88765 states and 125923 transitions. [2022-07-12 12:31:32,624 INFO L78 Accepts]: Start accepts. Automaton has 88765 states and 125923 transitions. Word has length 222 [2022-07-12 12:31:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:31:32,624 INFO L495 AbstractCegarLoop]: Abstraction has 88765 states and 125923 transitions. [2022-07-12 12:31:32,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-12 12:31:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 88765 states and 125923 transitions. [2022-07-12 12:31:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 12:31:32,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:31:32,638 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-07-12 12:31:32,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 12:31:32,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:31:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:31:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2088411672, now seen corresponding path program 1 times [2022-07-12 12:31:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:31:32,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537508996] [2022-07-12 12:31:32,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:31:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:31:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:32,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:31:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:32,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:31:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:32,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:31:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:31:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:32,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:31:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:31:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:31:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:31:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:31:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:31:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:31:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:31:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:31:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:31:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:31:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:31:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:31:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:31:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:31:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 12:31:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:31:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 12:31:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:31:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 12:31:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:31:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 12:31:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:31:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:31:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-07-12 12:31:33,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:31:33,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537508996] [2022-07-12 12:31:33,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537508996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:31:33,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:31:33,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 12:31:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878312879] [2022-07-12 12:31:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:31:33,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 12:31:33,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:31:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 12:31:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 12:31:33,265 INFO L87 Difference]: Start difference. First operand 88765 states and 125923 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 6 states have internal predecessors, (98), 5 states have call successors, (31), 8 states have call predecessors, (31), 3 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-12 12:31:35,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:37,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:41,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:46,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:49,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:31:51,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:32:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:32:08,783 INFO L93 Difference]: Finished difference Result 149872 states and 217824 transitions. [2022-07-12 12:32:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 12:32:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 6 states have internal predecessors, (98), 5 states have call successors, (31), 8 states have call predecessors, (31), 3 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 214 [2022-07-12 12:32:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:32:09,407 INFO L225 Difference]: With dead ends: 149872 [2022-07-12 12:32:09,408 INFO L226 Difference]: Without dead ends: 149869 [2022-07-12 12:32:09,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2022-07-12 12:32:09,465 INFO L413 NwaCegarLoop]: 3553 mSDtfsCounter, 7388 mSDsluCounter, 10303 mSDsCounter, 0 mSdLazyCounter, 13455 mSolverCounterSat, 4674 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7837 SdHoareTripleChecker+Valid, 13856 SdHoareTripleChecker+Invalid, 18135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4674 IncrementalHoareTripleChecker+Valid, 13455 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:32:09,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7837 Valid, 13856 Invalid, 18135 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4674 Valid, 13455 Invalid, 6 Unknown, 0 Unchecked, 30.6s Time] [2022-07-12 12:32:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149869 states. [2022-07-12 12:32:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149869 to 133057. [2022-07-12 12:32:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133057 states, 96616 states have (on average 1.3212614887803262) internal successors, (127655), 98895 states have internal predecessors, (127655), 27134 states have call successors, (27134), 8202 states have call predecessors, (27134), 9306 states have return successors, (34266), 26997 states have call predecessors, (34266), 27130 states have call successors, (34266) [2022-07-12 12:32:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133057 states to 133057 states and 189055 transitions. [2022-07-12 12:32:15,145 INFO L78 Accepts]: Start accepts. Automaton has 133057 states and 189055 transitions. Word has length 214 [2022-07-12 12:32:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:32:15,146 INFO L495 AbstractCegarLoop]: Abstraction has 133057 states and 189055 transitions. [2022-07-12 12:32:15,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 6 states have internal predecessors, (98), 5 states have call successors, (31), 8 states have call predecessors, (31), 3 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-12 12:32:15,147 INFO L276 IsEmpty]: Start isEmpty. Operand 133057 states and 189055 transitions. [2022-07-12 12:32:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-12 12:32:15,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:32:15,168 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 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] [2022-07-12 12:32:15,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 12:32:15,169 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:32:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:32:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash 366470254, now seen corresponding path program 1 times [2022-07-12 12:32:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:32:15,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474187950] [2022-07-12 12:32:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:15,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:32:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:32:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:32:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:32:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 12:32:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 12:32:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 12:32:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 12:32:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:32:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 12:32:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:32:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:32:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 12:32:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 12:32:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:32:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 12:32:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 12:32:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 12:32:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 12:32:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 12:32:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 12:32:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 12:32:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 12:32:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 12:32:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 12:32:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:32:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 12:32:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 12:32:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 12:32:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-07-12 12:32:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:32:15,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474187950] [2022-07-12 12:32:15,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474187950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:32:15,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692970212] [2022-07-12 12:32:15,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:32:15,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:32:15,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:32:15,722 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-12 12:32:15,727 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-12 12:32:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:32:16,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 6089 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:32:16,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:32:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-07-12 12:32:16,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:32:16,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692970212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:32:16,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:32:16,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 12:32:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359258078] [2022-07-12 12:32:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:32:16,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:32:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:32:16,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:32:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:32:16,985 INFO L87 Difference]: Start difference. First operand 133057 states and 189055 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29)