./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.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-commit-tester/main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.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 a39972fedd2c32e1b0c1a1e36e71e6a7f2f27ff7bdb89adfbd5175cf7e57ae01 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:48:40,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:48:40,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:48:40,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:48:40,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:48:40,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:48:40,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:48:40,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:48:40,708 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:48:40,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:48:40,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:48:40,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:48:40,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:48:40,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:48:40,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:48:40,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:48:40,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:48:40,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:48:40,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:48:40,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:48:40,724 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:48:40,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:48:40,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:48:40,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:48:40,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:48:40,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:48:40,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:48:40,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:48:40,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:48:40,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:48:40,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:48:40,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:48:40,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:48:40,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:48:40,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:48:40,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:48:40,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:48:40,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:48:40,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:48:40,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:48:40,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:48:40,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:48:40,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:48:40,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:48:40,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:48:40,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:48:40,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:48:40,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:48:40,774 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:48:40,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:48:40,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:48:40,775 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:48:40,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:48:40,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:48:40,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:48:40,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:48:40,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:48:40,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:48:40,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:48:40,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:48:40,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:48:40,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:48:40,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:48:40,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:48:40,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:48:40,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:48:40,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:48:40,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:48:40,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:48:40,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:48:40,780 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:48:40,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:48:40,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:48:40,780 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 -> a39972fedd2c32e1b0c1a1e36e71e6a7f2f27ff7bdb89adfbd5175cf7e57ae01 [2022-07-12 11:48:41,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:48:41,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:48:41,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:48:41,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:48:41,064 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:48:41,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i [2022-07-12 11:48:41,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3747b2e3/370011e8c7f241ffaaa6e6d60682d835/FLAG60a4374a4 [2022-07-12 11:48:41,995 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:48:41,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i [2022-07-12 11:48:42,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3747b2e3/370011e8c7f241ffaaa6e6d60682d835/FLAG60a4374a4 [2022-07-12 11:48:42,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3747b2e3/370011e8c7f241ffaaa6e6d60682d835 [2022-07-12 11:48:42,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:48:42,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:48:42,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:48:42,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:48:42,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:48:42,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:48:42" (1/1) ... [2022-07-12 11:48:42,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fea6c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:42, skipping insertion in model container [2022-07-12 11:48:42,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:48:42" (1/1) ... [2022-07-12 11:48:42,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:48:42,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:48:45,777 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-commit-tester/main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i[345486,345499] [2022-07-12 11:48:45,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:48:46,066 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:48:46,630 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-commit-tester/main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i[345486,345499] [2022-07-12 11:48:46,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:48:46,822 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:48:46,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46 WrapperNode [2022-07-12 11:48:46,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:48:46,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:48:46,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:48:46,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:48:46,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:46,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,130 INFO L137 Inliner]: procedures = 461, calls = 4752, calls flagged for inlining = 235, calls inlined = 28, statements flattened = 2825 [2022-07-12 11:48:47,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:48:47,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:48:47,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:48:47,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:48:47,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:48:47,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:48:47,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:48:47,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:48:47,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (1/1) ... [2022-07-12 11:48:47,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:48:47,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:48:47,469 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 11:48:47,493 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 11:48:47,509 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 11:48:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:48:47,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:48:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-12 11:48:47,510 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-12 11:48:47,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:48:47,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:48:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure set_frequency___0 [2022-07-12 11:48:47,511 INFO L138 BoogieDeclarations]: Found implementation of procedure set_frequency___0 [2022-07-12 11:48:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure set_tuner_mode [2022-07-12 11:48:47,511 INFO L138 BoogieDeclarations]: Found implementation of procedure set_tuner_mode [2022-07-12 11:48:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure poseidon_fm_close [2022-07-12 11:48:47,511 INFO L138 BoogieDeclarations]: Found implementation of procedure poseidon_fm_close [2022-07-12 11:48:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-12 11:48:47,512 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-12 11:48:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure video_devdata [2022-07-12 11:48:47,512 INFO L138 BoogieDeclarations]: Found implementation of procedure video_devdata [2022-07-12 11:48:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:48:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure poseidon_check_mode_radio [2022-07-12 11:48:47,512 INFO L138 BoogieDeclarations]: Found implementation of procedure poseidon_check_mode_radio [2022-07-12 11:48:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2022-07-12 11:48:47,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2022-07-12 11:48:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:48:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 11:48:47,513 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 11:48:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:48:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-07-12 11:48:47,514 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-07-12 11:48:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2022-07-12 11:48:47,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2022-07-12 11:48:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-12 11:48:47,514 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-12 11:48:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:48:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:48:47,514 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:48:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-12 11:48:47,515 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-12 11:48:47,515 INFO L130 BoogieDeclarations]: Found specification of procedure video_get_drvdata [2022-07-12 11:48:47,515 INFO L138 BoogieDeclarations]: Found implementation of procedure video_get_drvdata [2022-07-12 11:48:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:48:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:48:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_poseidon [2022-07-12 11:48:47,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_poseidon [2022-07-12 11:48:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-12 11:48:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-12 11:48:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:48:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 11:48:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock_of_poseidon [2022-07-12 11:48:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock_of_poseidon [2022-07-12 11:48:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-12 11:48:47,517 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-12 11:48:47,517 INFO L130 BoogieDeclarations]: Found specification of procedure send_set_req [2022-07-12 11:48:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure send_set_req [2022-07-12 11:48:47,518 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-12 11:48:47,518 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-12 11:48:47,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:48:47,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:48:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2022-07-12 11:48:47,520 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2022-07-12 11:48:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:48:47,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:48:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-12 11:48:47,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-12 11:48:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 11:48:47,521 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 11:48:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2022-07-12 11:48:47,521 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2022-07-12 11:48:47,521 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 11:48:47,522 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 11:48:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 11:48:47,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 11:48:47,522 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:48:47,523 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:48:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-12 11:48:47,523 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-12 11:48:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:48:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:48:47,523 INFO L130 BoogieDeclarations]: Found specification of procedure poseidon_fm_open [2022-07-12 11:48:47,524 INFO L138 BoogieDeclarations]: Found implementation of procedure poseidon_fm_open [2022-07-12 11:48:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:48:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-12 11:48:47,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-12 11:48:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure send_get_req [2022-07-12 11:48:47,524 INFO L138 BoogieDeclarations]: Found implementation of procedure send_get_req [2022-07-12 11:48:47,524 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:48:47,524 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:48:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:48:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:48:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure set_debug_mode [2022-07-12 11:48:47,525 INFO L138 BoogieDeclarations]: Found implementation of procedure set_debug_mode [2022-07-12 11:48:47,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-12 11:48:47,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-12 11:48:48,047 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:48:48,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:50:10,954 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:50:10,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:50:10,966 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 11:50:10,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:50:10 BoogieIcfgContainer [2022-07-12 11:50:10,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:50:10,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:50:10,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:50:10,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:50:10,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:48:42" (1/3) ... [2022-07-12 11:50:10,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1496b23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:50:10, skipping insertion in model container [2022-07-12 11:50:10,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:48:46" (2/3) ... [2022-07-12 11:50:10,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1496b23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:50:10, skipping insertion in model container [2022-07-12 11:50:10,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:50:10" (3/3) ... [2022-07-12 11:50:10,976 INFO L111 eAbstractionObserver]: Analyzing ICFG main3_drivers-media-video-tlg2300-poseidon-ko--32_7a--4a349aa.i [2022-07-12 11:50:10,987 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:50:10,988 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:50:11,042 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:50:11,047 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@62074cb6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74432d73 [2022-07-12 11:50:11,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:50:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 358 states have (on average 1.3519553072625698) internal successors, (484), 369 states have internal predecessors, (484), 119 states have call successors, (119), 37 states have call predecessors, (119), 37 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2022-07-12 11:50:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 11:50:11,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:50:11,063 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:50:11,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:50:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:50:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1124184562, now seen corresponding path program 1 times [2022-07-12 11:50:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:50:11,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309415704] [2022-07-12 11:50:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:50:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:50:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:50:12,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:50:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:50:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:50:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:50:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:50:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:50:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:50:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:50:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:50:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:50:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:50:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:50:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:50:12,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:50:12,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309415704] [2022-07-12 11:50:12,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309415704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:50:12,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:50:12,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:50:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459010885] [2022-07-12 11:50:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:50:12,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:50:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:50:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:50:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:50:12,841 INFO L87 Difference]: Start difference. First operand has 516 states, 358 states have (on average 1.3519553072625698) internal successors, (484), 369 states have internal predecessors, (484), 119 states have call successors, (119), 37 states have call predecessors, (119), 37 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 11:50:14,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:17,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:20,074 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 11:50:22,220 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 11:50:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:50:24,915 INFO L93 Difference]: Finished difference Result 1067 states and 1531 transitions. [2022-07-12 11:50:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:50:24,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2022-07-12 11:50:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:50:24,932 INFO L225 Difference]: With dead ends: 1067 [2022-07-12 11:50:24,932 INFO L226 Difference]: Without dead ends: 548 [2022-07-12 11:50:24,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:50:24,944 INFO L413 NwaCegarLoop]: 681 mSDtfsCounter, 329 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 268 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:50:24,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1134 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 472 Invalid, 4 Unknown, 0 Unchecked, 11.8s Time] [2022-07-12 11:50:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-12 11:50:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 508. [2022-07-12 11:50:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 353 states have (on average 1.3456090651558075) internal successors, (475), 362 states have internal predecessors, (475), 119 states have call successors, (119), 37 states have call predecessors, (119), 35 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-12 11:50:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 705 transitions. [2022-07-12 11:50:25,028 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 705 transitions. Word has length 150 [2022-07-12 11:50:25,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:50:25,028 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 705 transitions. [2022-07-12 11:50:25,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 11:50:25,029 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2022-07-12 11:50:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 11:50:25,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:50:25,031 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:50:25,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:50:25,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:50:25,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:50:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2104114830, now seen corresponding path program 1 times [2022-07-12 11:50:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:50:25,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468153616] [2022-07-12 11:50:25,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:50:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:50:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:50:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:50:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:50:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:50:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:50:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:50:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:50:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:50:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:50:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:50:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:50:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:50:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:50:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:50:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:50:26,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468153616] [2022-07-12 11:50:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468153616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:50:26,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:50:26,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:50:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568283976] [2022-07-12 11:50:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:50:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:50:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:50:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:50:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:50:26,427 INFO L87 Difference]: Start difference. First operand 508 states and 705 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:50:28,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:30,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:32,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:36,113 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 11:50:38,336 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 11:50:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:50:41,963 INFO L93 Difference]: Finished difference Result 557 states and 768 transitions. [2022-07-12 11:50:41,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:50:41,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 150 [2022-07-12 11:50:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:50:41,975 INFO L225 Difference]: With dead ends: 557 [2022-07-12 11:50:41,975 INFO L226 Difference]: Without dead ends: 553 [2022-07-12 11:50:41,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:50:41,977 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 571 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 294 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:50:41,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1276 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 755 Invalid, 5 Unknown, 0 Unchecked, 15.1s Time] [2022-07-12 11:50:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-12 11:50:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 510. [2022-07-12 11:50:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 356 states have (on average 1.3370786516853932) internal successors, (476), 363 states have internal predecessors, (476), 117 states have call successors, (117), 38 states have call predecessors, (117), 36 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-12 11:50:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 704 transitions. [2022-07-12 11:50:42,016 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 704 transitions. Word has length 150 [2022-07-12 11:50:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:50:42,017 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 704 transitions. [2022-07-12 11:50:42,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:50:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 704 transitions. [2022-07-12 11:50:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 11:50:42,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:50:42,020 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:50:42,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:50:42,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:50:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:50:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 802427563, now seen corresponding path program 1 times [2022-07-12 11:50:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:50:42,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712495551] [2022-07-12 11:50:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:50:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:50:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:50:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:50:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:50:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:50:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:50:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:50:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:50:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:50:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:50:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:50:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:50:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:50:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:42,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:50:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:50:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:50:43,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712495551] [2022-07-12 11:50:43,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712495551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:50:43,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:50:43,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:50:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959201114] [2022-07-12 11:50:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:50:43,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:50:43,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:50:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:50:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:50:43,069 INFO L87 Difference]: Start difference. First operand 510 states and 704 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:50:45,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:47,225 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 11:50:49,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:50:52,894 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 11:50:55,073 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 11:50:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:50:58,432 INFO L93 Difference]: Finished difference Result 552 states and 762 transitions. [2022-07-12 11:50:58,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:50:58,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 151 [2022-07-12 11:50:58,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:50:58,437 INFO L225 Difference]: With dead ends: 552 [2022-07-12 11:50:58,437 INFO L226 Difference]: Without dead ends: 549 [2022-07-12 11:50:58,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:50:58,438 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 798 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 356 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:50:58,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1090 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 612 Invalid, 5 Unknown, 0 Unchecked, 14.8s Time] [2022-07-12 11:50:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-07-12 11:50:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 509. [2022-07-12 11:50:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 356 states have (on average 1.3342696629213484) internal successors, (475), 362 states have internal predecessors, (475), 116 states have call successors, (116), 38 states have call predecessors, (116), 36 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-12 11:50:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 702 transitions. [2022-07-12 11:50:58,465 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 702 transitions. Word has length 151 [2022-07-12 11:50:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:50:58,466 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 702 transitions. [2022-07-12 11:50:58,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:50:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 702 transitions. [2022-07-12 11:50:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 11:50:58,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:50:58,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:50:58,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:50:58,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:50:58,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:50:58,469 INFO L85 PathProgramCache]: Analyzing trace with hash -895167183, now seen corresponding path program 1 times [2022-07-12 11:50:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:50:58,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64136867] [2022-07-12 11:50:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:50:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:50:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:50:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:50:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:50:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:50:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:50:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:50:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:50:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:50:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:50:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:50:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:50:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:50:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:50:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:50:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:50:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:50:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:50:59,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64136867] [2022-07-12 11:50:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64136867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:50:59,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:50:59,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:50:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595674200] [2022-07-12 11:50:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:50:59,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:50:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:50:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:50:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:50:59,573 INFO L87 Difference]: Start difference. First operand 509 states and 702 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:51:01,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:03,715 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 11:51:05,760 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 11:51:09,314 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 11:51:11,547 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 11:51:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:51:14,384 INFO L93 Difference]: Finished difference Result 551 states and 760 transitions. [2022-07-12 11:51:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:51:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 152 [2022-07-12 11:51:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:51:14,389 INFO L225 Difference]: With dead ends: 551 [2022-07-12 11:51:14,389 INFO L226 Difference]: Without dead ends: 548 [2022-07-12 11:51:14,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:51:14,391 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 805 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 359 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:51:14,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1077 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 600 Invalid, 5 Unknown, 0 Unchecked, 14.3s Time] [2022-07-12 11:51:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-12 11:51:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 508. [2022-07-12 11:51:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 356 states have (on average 1.3314606741573034) internal successors, (474), 361 states have internal predecessors, (474), 115 states have call successors, (115), 38 states have call predecessors, (115), 36 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-12 11:51:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 700 transitions. [2022-07-12 11:51:14,415 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 700 transitions. Word has length 152 [2022-07-12 11:51:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:51:14,415 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 700 transitions. [2022-07-12 11:51:14,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:51:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 700 transitions. [2022-07-12 11:51:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 11:51:14,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:51:14,418 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:14,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:51:14,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:51:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:51:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1980991890, now seen corresponding path program 1 times [2022-07-12 11:51:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:51:14,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969520709] [2022-07-12 11:51:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:51:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:51:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:51:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:51:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:51:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:14,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:51:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:51:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:51:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:51:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:51:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:51:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:51:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:51:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:51:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:51:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:51:15,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:51:15,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969520709] [2022-07-12 11:51:15,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969520709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:51:15,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:51:15,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:51:15,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641256396] [2022-07-12 11:51:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:51:15,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:51:15,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:51:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:51:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:51:15,415 INFO L87 Difference]: Start difference. First operand 508 states and 700 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:51:17,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:19,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:21,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:25,002 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 11:51:27,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:51:30,279 INFO L93 Difference]: Finished difference Result 550 states and 758 transitions. [2022-07-12 11:51:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:51:30,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 153 [2022-07-12 11:51:30,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:51:30,284 INFO L225 Difference]: With dead ends: 550 [2022-07-12 11:51:30,285 INFO L226 Difference]: Without dead ends: 547 [2022-07-12 11:51:30,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:51:30,291 INFO L413 NwaCegarLoop]: 593 mSDtfsCounter, 801 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 350 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:51:30,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1078 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 599 Invalid, 5 Unknown, 0 Unchecked, 14.4s Time] [2022-07-12 11:51:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-07-12 11:51:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 507. [2022-07-12 11:51:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 356 states have (on average 1.3286516853932584) internal successors, (473), 360 states have internal predecessors, (473), 114 states have call successors, (114), 38 states have call predecessors, (114), 36 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-12 11:51:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 698 transitions. [2022-07-12 11:51:30,319 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 698 transitions. Word has length 153 [2022-07-12 11:51:30,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:51:30,320 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 698 transitions. [2022-07-12 11:51:30,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:51:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 698 transitions. [2022-07-12 11:51:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-12 11:51:30,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:51:30,322 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:30,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:51:30,323 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:51:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:51:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1281814572, now seen corresponding path program 1 times [2022-07-12 11:51:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:51:30,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064614069] [2022-07-12 11:51:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:51:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:51:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:51:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:51:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:51:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:51:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:51:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:51:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:51:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:51:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:51:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:51:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:51:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:51:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:51:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:51:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:51:31,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064614069] [2022-07-12 11:51:31,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064614069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:51:31,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:51:31,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:51:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819774054] [2022-07-12 11:51:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:51:31,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:51:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:51:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:51:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:51:31,342 INFO L87 Difference]: Start difference. First operand 507 states and 698 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:51:33,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:35,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:37,533 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 11:51:40,861 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 11:51:43,062 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 11:51:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:51:46,274 INFO L93 Difference]: Finished difference Result 549 states and 756 transitions. [2022-07-12 11:51:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:51:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 154 [2022-07-12 11:51:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:51:46,279 INFO L225 Difference]: With dead ends: 549 [2022-07-12 11:51:46,280 INFO L226 Difference]: Without dead ends: 540 [2022-07-12 11:51:46,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:51:46,281 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 788 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 344 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:51:46,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1086 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 607 Invalid, 5 Unknown, 0 Unchecked, 14.5s Time] [2022-07-12 11:51:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-12 11:51:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 500. [2022-07-12 11:51:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 351 states have (on average 1.3276353276353277) internal successors, (466), 354 states have internal predecessors, (466), 112 states have call successors, (112), 37 states have call predecessors, (112), 36 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-12 11:51:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 689 transitions. [2022-07-12 11:51:46,306 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 689 transitions. Word has length 154 [2022-07-12 11:51:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:51:46,307 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 689 transitions. [2022-07-12 11:51:46,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-12 11:51:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 689 transitions. [2022-07-12 11:51:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 11:51:46,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:51:46,310 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:51:46,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:51:46,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:51:46,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:51:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1118355632, now seen corresponding path program 1 times [2022-07-12 11:51:46,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:51:46,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015180028] [2022-07-12 11:51:46,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:51:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:51:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:51:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:51:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:51:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:51:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:51:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:51:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:51:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:51:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:51:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:51:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:51:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:51:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:51:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:51:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:51:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 11:51:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:51:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 11:51:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:51:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:51:47,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:51:47,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015180028] [2022-07-12 11:51:47,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015180028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:51:47,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:51:47,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:51:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812762098] [2022-07-12 11:51:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:51:47,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:51:47,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:51:47,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:51:47,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:51:47,733 INFO L87 Difference]: Start difference. First operand 500 states and 689 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, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:51:49,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:51,904 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 11:51:53,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:51:58,297 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 11:52:00,510 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 11:52:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:52:06,061 INFO L93 Difference]: Finished difference Result 1143 states and 1605 transitions. [2022-07-12 11:52:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:52:06,061 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, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 181 [2022-07-12 11:52:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:52:06,068 INFO L225 Difference]: With dead ends: 1143 [2022-07-12 11:52:06,069 INFO L226 Difference]: Without dead ends: 688 [2022-07-12 11:52:06,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:52:06,073 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 472 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 323 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:52:06,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1700 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1003 Invalid, 5 Unknown, 0 Unchecked, 18.1s Time] [2022-07-12 11:52:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-07-12 11:52:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 648. [2022-07-12 11:52:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 467 states have (on average 1.3468950749464668) internal successors, (629), 470 states have internal predecessors, (629), 144 states have call successors, (144), 37 states have call predecessors, (144), 36 states have return successors, (143), 143 states have call predecessors, (143), 143 states have call successors, (143) [2022-07-12 11:52:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 916 transitions. [2022-07-12 11:52:06,114 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 916 transitions. Word has length 181 [2022-07-12 11:52:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:52:06,118 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 916 transitions. [2022-07-12 11:52:06,118 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, (21), 5 states have call predecessors, (21), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:52:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 916 transitions. [2022-07-12 11:52:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-12 11:52:06,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:52:06,124 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:06,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:52:06,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:52:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:52:06,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1341331347, now seen corresponding path program 1 times [2022-07-12 11:52:06,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:52:06,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125903457] [2022-07-12 11:52:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:52:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:52:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:52:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:06,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 11:52:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 11:52:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:52:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:52:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:52:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:52:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:52:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:52:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:52:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 11:52:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 11:52:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:52:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:52:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:52:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:52:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 11:52:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 11:52:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:52:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 11:52:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:52:07,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125903457] [2022-07-12 11:52:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125903457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:52:07,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:52:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:52:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977215398] [2022-07-12 11:52:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:52:07,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:52:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:52:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:52:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:52:07,994 INFO L87 Difference]: Start difference. First operand 648 states and 916 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:52:10,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:52:12,129 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 11:52:14,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:52:17,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:52:20,178 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 11:52:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:52:23,839 INFO L93 Difference]: Finished difference Result 701 states and 995 transitions. [2022-07-12 11:52:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:52:23,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 192 [2022-07-12 11:52:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:52:23,840 INFO L225 Difference]: With dead ends: 701 [2022-07-12 11:52:23,840 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:52:23,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:52:23,843 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 830 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 631 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 631 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:52:23,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1331 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [631 Valid, 644 Invalid, 5 Unknown, 0 Unchecked, 14.9s Time] [2022-07-12 11:52:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:52:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:52:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 11:52:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:52:23,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2022-07-12 11:52:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:52:23,845 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:52:23,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:52:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:52:23,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:52:23,848 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:52:23,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:52:23,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.