./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1f258bb699a014f11eb0babe874a45670072f33ce1154e31a2f0110b34e4ef74 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 15:22:39,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 15:22:39,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 15:22:40,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 15:22:40,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 15:22:40,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 15:22:40,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 15:22:40,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 15:22:40,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 15:22:40,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 15:22:40,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 15:22:40,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 15:22:40,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 15:22:40,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 15:22:40,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 15:22:40,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 15:22:40,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 15:22:40,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 15:22:40,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 15:22:40,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 15:22:40,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 15:22:40,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 15:22:40,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 15:22:40,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 15:22:40,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 15:22:40,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 15:22:40,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 15:22:40,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 15:22:40,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 15:22:40,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 15:22:40,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 15:22:40,062 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 15:22:40,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 15:22:40,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 15:22:40,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 15:22:40,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 15:22:40,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 15:22:40,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 15:22:40,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 15:22:40,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 15:22:40,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 15:22:40,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 15:22:40,101 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 15:22:40,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 15:22:40,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 15:22:40,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 15:22:40,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 15:22:40,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 15:22:40,103 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 15:22:40,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 15:22:40,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 15:22:40,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 15:22:40,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 15:22:40,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 15:22:40,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 15:22:40,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 15:22:40,108 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 15:22:40,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 15:22:40,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 15:22:40,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 15:22:40,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 15:22:40,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:22:40,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 15:22:40,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 15:22:40,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 15:22:40,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 15:22:40,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 15:22:40,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 15:22:40,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 15:22:40,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 15:22:40,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 15:22:40,111 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 -> 1f258bb699a014f11eb0babe874a45670072f33ce1154e31a2f0110b34e4ef74 [2021-11-06 15:22:40,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 15:22:40,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 15:22:40,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 15:22:40,298 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 15:22:40,299 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 15:22:40,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2021-11-06 15:22:40,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b581cae27/510ff1fede1c4293889fdc238b291cb5/FLAG9dbc84139 [2021-11-06 15:22:41,029 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 15:22:41,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2021-11-06 15:22:41,071 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b581cae27/510ff1fede1c4293889fdc238b291cb5/FLAG9dbc84139 [2021-11-06 15:22:41,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b581cae27/510ff1fede1c4293889fdc238b291cb5 [2021-11-06 15:22:41,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 15:22:41,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 15:22:41,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 15:22:41,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 15:22:41,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 15:22:41,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:22:41" (1/1) ... [2021-11-06 15:22:41,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff7816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:41, skipping insertion in model container [2021-11-06 15:22:41,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 03:22:41" (1/1) ... [2021-11-06 15:22:41,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 15:22:41,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 15:22:42,683 WARN L228 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-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i[239447,239460] [2021-11-06 15:22:42,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:22:42,747 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 15:22:42,995 WARN L228 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-validator-v0.8/linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i[239447,239460] [2021-11-06 15:22:43,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 15:22:43,101 INFO L208 MainTranslator]: Completed translation [2021-11-06 15:22:43,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43 WrapperNode [2021-11-06 15:22:43,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 15:22:43,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 15:22:43,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 15:22:43,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 15:22:43,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:43,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:44,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 15:22:44,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 15:22:44,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 15:22:44,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 15:22:44,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:44,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:45,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:45,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:46,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:46,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:46,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:46,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 15:22:46,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 15:22:46,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 15:22:46,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 15:22:46,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (1/1) ... [2021-11-06 15:22:46,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 15:22:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 15:22:46,566 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) [2021-11-06 15:22:46,571 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 [2021-11-06 15:22:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 15:22:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 15:22:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_usb_bulk_msg [2021-11-06 15:22:46,589 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_usb_bulk_msg [2021-11-06 15:22:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-06 15:22:46,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-06 15:22:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_signal_sdio_irq [2021-11-06 15:22:46,590 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_signal_sdio_irq [2021-11-06 15:22:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2021-11-06 15:22:46,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2021-11-06 15:22:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_29 [2021-11-06 15:22:46,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_29 [2021-11-06 15:22:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure __command_read_data [2021-11-06 15:22:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_read_data [2021-11-06 15:22:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 15:22:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_27 [2021-11-06 15:22:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_27 [2021-11-06 15:22:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 15:22:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_13 [2021-11-06 15:22:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_13 [2021-11-06 15:22:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure irqpoll_out_completed [2021-11-06 15:22:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure irqpoll_out_completed [2021-11-06 15:22:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_15 [2021-11-06 15:22:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_15 [2021-11-06 15:22:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 15:22:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 15:22:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_enable_sdio_irq [2021-11-06 15:22:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_enable_sdio_irq [2021-11-06 15:22:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure command_out_completed [2021-11-06 15:22:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure command_out_completed [2021-11-06 15:22:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 15:22:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_cmndwork_thread [2021-11-06 15:22:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_cmndwork_thread [2021-11-06 15:22:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 15:22:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure send_command [2021-11-06 15:22:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure send_command [2021-11-06 15:22:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 15:22:46,593 INFO L130 BoogieDeclarations]: Found specification of procedure send_irqpoll [2021-11-06 15:22:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure send_irqpoll [2021-11-06 15:22:46,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 15:22:46,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_32 [2021-11-06 15:22:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_32 [2021-11-06 15:22:46,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 15:22:46,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 15:22:46,594 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 15:22:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 15:22:46,594 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_pollwork_thread [2021-11-06 15:22:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_pollwork_thread [2021-11-06 15:22:46,595 INFO L130 BoogieDeclarations]: Found specification of procedure __do_poll [2021-11-06 15:22:46,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_poll [2021-11-06 15:22:46,595 INFO L130 BoogieDeclarations]: Found specification of procedure __command_write_data [2021-11-06 15:22:46,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_write_data [2021-11-06 15:22:46,595 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2021-11-06 15:22:46,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 15:22:46,595 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-06 15:22:46,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 15:22:46,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 15:23:09,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 15:23:09,314 INFO L299 CfgBuilder]: Removed 14764 assume(true) statements. [2021-11-06 15:23:09,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:23:09 BoogieIcfgContainer [2021-11-06 15:23:09,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 15:23:09,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 15:23:09,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 15:23:09,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 15:23:09,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 03:22:41" (1/3) ... [2021-11-06 15:23:09,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e84808f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:23:09, skipping insertion in model container [2021-11-06 15:23:09,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 03:22:43" (2/3) ... [2021-11-06 15:23:09,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e84808f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 03:23:09, skipping insertion in model container [2021-11-06 15:23:09,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 03:23:09" (3/3) ... [2021-11-06 15:23:09,332 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-063f96c-1-144_1a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2021-11-06 15:23:09,337 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 15:23:09,338 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-06 15:23:09,394 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 15:23:09,400 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 15:23:09,400 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-06 15:23:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 11120 states, 11055 states have (on average 1.4388964269561284) internal successors, (15907), 11066 states have internal predecessors, (15907), 40 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2021-11-06 15:23:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 15:23:09,525 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:09,526 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:09,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -490614643, now seen corresponding path program 1 times [2021-11-06 15:23:09,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:09,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085115420] [2021-11-06 15:23:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:09,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:09,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:09,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085115420] [2021-11-06 15:23:09,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085115420] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:09,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:09,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:23:09,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239888222] [2021-11-06 15:23:09,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 15:23:09,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:09,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 15:23:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 15:23:10,005 INFO L87 Difference]: Start difference. First operand has 11120 states, 11055 states have (on average 1.4388964269561284) internal successors, (15907), 11066 states have internal predecessors, (15907), 40 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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) [2021-11-06 15:23:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:10,271 INFO L93 Difference]: Finished difference Result 22236 states and 32001 transitions. [2021-11-06 15:23:10,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 15:23:10,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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) Word has length 47 [2021-11-06 15:23:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:10,329 INFO L225 Difference]: With dead ends: 22236 [2021-11-06 15:23:10,330 INFO L226 Difference]: Without dead ends: 11103 [2021-11-06 15:23:10,363 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 15:23:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2021-11-06 15:23:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 11103. [2021-11-06 15:23:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11103 states, 11039 states have (on average 1.4358184618171936) internal successors, (15850), 11049 states have internal predecessors, (15850), 40 states have call successors, (40), 20 states have call predecessors, (40), 20 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2021-11-06 15:23:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11103 states to 11103 states and 15930 transitions. [2021-11-06 15:23:10,649 INFO L78 Accepts]: Start accepts. Automaton has 11103 states and 15930 transitions. Word has length 47 [2021-11-06 15:23:10,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:10,650 INFO L470 AbstractCegarLoop]: Abstraction has 11103 states and 15930 transitions. [2021-11-06 15:23:10,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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) [2021-11-06 15:23:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 11103 states and 15930 transitions. [2021-11-06 15:23:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 15:23:10,654 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:10,654 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:10,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 15:23:10,654 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:10,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1635357639, now seen corresponding path program 1 times [2021-11-06 15:23:10,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:10,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492455676] [2021-11-06 15:23:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:10,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:10,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:10,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492455676] [2021-11-06 15:23:10,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492455676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:10,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:10,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:23:10,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431884529] [2021-11-06 15:23:10,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:10,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:10,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:10,829 INFO L87 Difference]: Start difference. First operand 11103 states and 15930 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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) [2021-11-06 15:23:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:14,279 INFO L93 Difference]: Finished difference Result 33242 states and 47793 transitions. [2021-11-06 15:23:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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) Word has length 47 [2021-11-06 15:23:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:14,372 INFO L225 Difference]: With dead ends: 33242 [2021-11-06 15:23:14,373 INFO L226 Difference]: Without dead ends: 22167 [2021-11-06 15:23:14,548 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22167 states. [2021-11-06 15:23:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22167 to 22167. [2021-11-06 15:23:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22167 states, 22043 states have (on average 1.4064328811867712) internal successors, (31002), 22060 states have internal predecessors, (31002), 80 states have call successors, (80), 40 states have call predecessors, (80), 40 states have return successors, (112), 74 states have call predecessors, (112), 80 states have call successors, (112) [2021-11-06 15:23:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22167 states to 22167 states and 31194 transitions. [2021-11-06 15:23:15,001 INFO L78 Accepts]: Start accepts. Automaton has 22167 states and 31194 transitions. Word has length 47 [2021-11-06 15:23:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:15,002 INFO L470 AbstractCegarLoop]: Abstraction has 22167 states and 31194 transitions. [2021-11-06 15:23:15,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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) [2021-11-06 15:23:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 22167 states and 31194 transitions. [2021-11-06 15:23:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 15:23:15,008 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:15,008 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:15,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 15:23:15,008 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash -843473344, now seen corresponding path program 1 times [2021-11-06 15:23:15,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:15,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553494376] [2021-11-06 15:23:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:15,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:15,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:15,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553494376] [2021-11-06 15:23:15,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553494376] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:15,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:15,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:23:15,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867056407] [2021-11-06 15:23:15,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:15,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:15,174 INFO L87 Difference]: Start difference. First operand 22167 states and 31194 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2021-11-06 15:23:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:17,362 INFO L93 Difference]: Finished difference Result 66127 states and 93206 transitions. [2021-11-06 15:23:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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) Word has length 48 [2021-11-06 15:23:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:17,511 INFO L225 Difference]: With dead ends: 66127 [2021-11-06 15:23:17,511 INFO L226 Difference]: Without dead ends: 43988 [2021-11-06 15:23:17,563 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43988 states. [2021-11-06 15:23:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43988 to 43970. [2021-11-06 15:23:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43970 states, 43726 states have (on average 1.392169418652518) internal successors, (60874), 43757 states have internal predecessors, (60874), 160 states have call successors, (160), 80 states have call predecessors, (160), 80 states have return successors, (224), 148 states have call predecessors, (224), 160 states have call successors, (224) [2021-11-06 15:23:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43970 states to 43970 states and 61258 transitions. [2021-11-06 15:23:18,518 INFO L78 Accepts]: Start accepts. Automaton has 43970 states and 61258 transitions. Word has length 48 [2021-11-06 15:23:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:18,520 INFO L470 AbstractCegarLoop]: Abstraction has 43970 states and 61258 transitions. [2021-11-06 15:23:18,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2021-11-06 15:23:18,520 INFO L276 IsEmpty]: Start isEmpty. Operand 43970 states and 61258 transitions. [2021-11-06 15:23:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 15:23:18,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:18,523 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:18,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 15:23:18,524 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -377822479, now seen corresponding path program 1 times [2021-11-06 15:23:18,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:18,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743998131] [2021-11-06 15:23:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:18,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:18,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:18,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743998131] [2021-11-06 15:23:18,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743998131] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:18,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:18,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:23:18,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747812367] [2021-11-06 15:23:18,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:18,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:18,669 INFO L87 Difference]: Start difference. First operand 43970 states and 61258 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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) [2021-11-06 15:23:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:19,181 INFO L93 Difference]: Finished difference Result 43970 states and 61258 transitions. [2021-11-06 15:23:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:19,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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) Word has length 49 [2021-11-06 15:23:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:19,287 INFO L225 Difference]: With dead ends: 43970 [2021-11-06 15:23:19,288 INFO L226 Difference]: Without dead ends: 43968 [2021-11-06 15:23:19,312 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43968 states. [2021-11-06 15:23:20,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43968 to 43968. [2021-11-06 15:23:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43968 states, 43725 states have (on average 1.3921555174385363) internal successors, (60872), 43755 states have internal predecessors, (60872), 160 states have call successors, (160), 80 states have call predecessors, (160), 80 states have return successors, (224), 148 states have call predecessors, (224), 160 states have call successors, (224) [2021-11-06 15:23:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43968 states to 43968 states and 61256 transitions. [2021-11-06 15:23:20,317 INFO L78 Accepts]: Start accepts. Automaton has 43968 states and 61256 transitions. Word has length 49 [2021-11-06 15:23:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:20,318 INFO L470 AbstractCegarLoop]: Abstraction has 43968 states and 61256 transitions. [2021-11-06 15:23:20,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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) [2021-11-06 15:23:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 43968 states and 61256 transitions. [2021-11-06 15:23:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 15:23:20,320 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:20,321 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:20,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 15:23:20,321 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:20,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1172452458, now seen corresponding path program 1 times [2021-11-06 15:23:20,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:20,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9504565] [2021-11-06 15:23:20,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:20,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:20,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:20,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9504565] [2021-11-06 15:23:20,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9504565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:20,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:20,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 15:23:20,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956190436] [2021-11-06 15:23:20,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:20,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:20,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:20,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:20,450 INFO L87 Difference]: Start difference. First operand 43968 states and 61256 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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) [2021-11-06 15:23:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:21,286 INFO L93 Difference]: Finished difference Result 43968 states and 61256 transitions. [2021-11-06 15:23:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:21,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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) Word has length 50 [2021-11-06 15:23:21,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:21,394 INFO L225 Difference]: With dead ends: 43968 [2021-11-06 15:23:21,394 INFO L226 Difference]: Without dead ends: 37972 [2021-11-06 15:23:21,419 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37972 states. [2021-11-06 15:23:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37972 to 37972. [2021-11-06 15:23:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37972 states, 37730 states have (on average 1.4002915451895044) internal successors, (52833), 37759 states have internal predecessors, (52833), 160 states have call successors, (160), 80 states have call predecessors, (160), 80 states have return successors, (224), 148 states have call predecessors, (224), 160 states have call successors, (224) [2021-11-06 15:23:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37972 states to 37972 states and 53217 transitions. [2021-11-06 15:23:22,365 INFO L78 Accepts]: Start accepts. Automaton has 37972 states and 53217 transitions. Word has length 50 [2021-11-06 15:23:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:22,367 INFO L470 AbstractCegarLoop]: Abstraction has 37972 states and 53217 transitions. [2021-11-06 15:23:22,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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) [2021-11-06 15:23:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 37972 states and 53217 transitions. [2021-11-06 15:23:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 15:23:22,379 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:22,379 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:22,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 15:23:22,380 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash 861531681, now seen corresponding path program 1 times [2021-11-06 15:23:22,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:22,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505746846] [2021-11-06 15:23:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:22,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:22,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:22,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505746846] [2021-11-06 15:23:22,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505746846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:22,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:22,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:23:22,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439287015] [2021-11-06 15:23:22,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:22,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:22,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:22,490 INFO L87 Difference]: Start difference. First operand 37972 states and 53217 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-06 15:23:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:23,560 INFO L93 Difference]: Finished difference Result 91243 states and 127894 transitions. [2021-11-06 15:23:23,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:23,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) Word has length 73 [2021-11-06 15:23:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:23,717 INFO L225 Difference]: With dead ends: 91243 [2021-11-06 15:23:23,718 INFO L226 Difference]: Without dead ends: 53299 [2021-11-06 15:23:23,785 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53299 states. [2021-11-06 15:23:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53299 to 53284. [2021-11-06 15:23:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53284 states, 52802 states have (on average 1.3999659103821824) internal successors, (73921), 52859 states have internal predecessors, (73921), 320 states have call successors, (320), 160 states have call predecessors, (320), 160 states have return successors, (448), 296 states have call predecessors, (448), 320 states have call successors, (448) [2021-11-06 15:23:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53284 states to 53284 states and 74689 transitions. [2021-11-06 15:23:25,124 INFO L78 Accepts]: Start accepts. Automaton has 53284 states and 74689 transitions. Word has length 73 [2021-11-06 15:23:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:25,124 INFO L470 AbstractCegarLoop]: Abstraction has 53284 states and 74689 transitions. [2021-11-06 15:23:25,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-06 15:23:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 53284 states and 74689 transitions. [2021-11-06 15:23:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 15:23:25,154 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:25,154 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:25,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 15:23:25,155 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash -901970140, now seen corresponding path program 1 times [2021-11-06 15:23:25,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:25,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626390370] [2021-11-06 15:23:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:25,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 15:23:25,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:25,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626390370] [2021-11-06 15:23:25,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626390370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:25,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:25,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:23:25,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652393452] [2021-11-06 15:23:25,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:23:25,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:25,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:23:25,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:23:25,297 INFO L87 Difference]: Start difference. First operand 53284 states and 74689 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2021-11-06 15:23:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:27,237 INFO L93 Difference]: Finished difference Result 129992 states and 182353 transitions. [2021-11-06 15:23:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:23:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) Word has length 99 [2021-11-06 15:23:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:27,444 INFO L225 Difference]: With dead ends: 129992 [2021-11-06 15:23:27,444 INFO L226 Difference]: Without dead ends: 76736 [2021-11-06 15:23:27,699 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:23:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76736 states. [2021-11-06 15:23:29,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76736 to 53298. [2021-11-06 15:23:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53298 states, 52816 states have (on average 1.3998598909421387) internal successors, (73935), 52873 states have internal predecessors, (73935), 320 states have call successors, (320), 160 states have call predecessors, (320), 160 states have return successors, (448), 296 states have call predecessors, (448), 320 states have call successors, (448) [2021-11-06 15:23:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53298 states to 53298 states and 74703 transitions. [2021-11-06 15:23:29,201 INFO L78 Accepts]: Start accepts. Automaton has 53298 states and 74703 transitions. Word has length 99 [2021-11-06 15:23:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:29,202 INFO L470 AbstractCegarLoop]: Abstraction has 53298 states and 74703 transitions. [2021-11-06 15:23:29,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2021-11-06 15:23:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 53298 states and 74703 transitions. [2021-11-06 15:23:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 15:23:29,232 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:29,233 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:29,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 15:23:29,233 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:29,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1847690109, now seen corresponding path program 1 times [2021-11-06 15:23:29,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:29,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308294042] [2021-11-06 15:23:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:29,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:23:29,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:29,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308294042] [2021-11-06 15:23:29,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308294042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:29,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:29,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:23:29,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698206771] [2021-11-06 15:23:29,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:29,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:29,368 INFO L87 Difference]: Start difference. First operand 53298 states and 74703 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2021-11-06 15:23:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:33,154 INFO L93 Difference]: Finished difference Result 121768 states and 170906 transitions. [2021-11-06 15:23:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) Word has length 103 [2021-11-06 15:23:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:33,341 INFO L225 Difference]: With dead ends: 121768 [2021-11-06 15:23:33,342 INFO L226 Difference]: Without dead ends: 68498 [2021-11-06 15:23:33,451 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68498 states. [2021-11-06 15:23:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68498 to 68498. [2021-11-06 15:23:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68498 states, 67536 states have (on average 1.4019337834636343) internal successors, (94681), 67649 states have internal predecessors, (94681), 640 states have call successors, (640), 320 states have call predecessors, (640), 320 states have return successors, (896), 592 states have call predecessors, (896), 640 states have call successors, (896) [2021-11-06 15:23:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68498 states to 68498 states and 96217 transitions. [2021-11-06 15:23:35,442 INFO L78 Accepts]: Start accepts. Automaton has 68498 states and 96217 transitions. Word has length 103 [2021-11-06 15:23:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:35,442 INFO L470 AbstractCegarLoop]: Abstraction has 68498 states and 96217 transitions. [2021-11-06 15:23:35,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2021-11-06 15:23:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 68498 states and 96217 transitions. [2021-11-06 15:23:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-06 15:23:35,493 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:35,493 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:35,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 15:23:35,494 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 808525327, now seen corresponding path program 1 times [2021-11-06 15:23:35,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:35,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727067559] [2021-11-06 15:23:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:35,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 15:23:35,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:35,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727067559] [2021-11-06 15:23:35,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727067559] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:35,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:35,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 15:23:35,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916719474] [2021-11-06 15:23:35,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 15:23:35,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:35,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 15:23:35,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:35,639 INFO L87 Difference]: Start difference. First operand 68498 states and 96217 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2021-11-06 15:23:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:23:39,299 INFO L93 Difference]: Finished difference Result 115361 states and 161881 transitions. [2021-11-06 15:23:39,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 15:23:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) Word has length 118 [2021-11-06 15:23:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:23:39,411 INFO L225 Difference]: With dead ends: 115361 [2021-11-06 15:23:39,411 INFO L226 Difference]: Without dead ends: 46889 [2021-11-06 15:23:39,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 15:23:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46889 states. [2021-11-06 15:23:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46889 to 46883. [2021-11-06 15:23:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46883 states, 46281 states have (on average 1.3984788574144897) internal successors, (64723), 46352 states have internal predecessors, (64723), 400 states have call successors, (400), 200 states have call predecessors, (400), 200 states have return successors, (560), 370 states have call predecessors, (560), 400 states have call successors, (560) [2021-11-06 15:23:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46883 states to 46883 states and 65683 transitions. [2021-11-06 15:23:40,974 INFO L78 Accepts]: Start accepts. Automaton has 46883 states and 65683 transitions. Word has length 118 [2021-11-06 15:23:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:23:40,975 INFO L470 AbstractCegarLoop]: Abstraction has 46883 states and 65683 transitions. [2021-11-06 15:23:40,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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) [2021-11-06 15:23:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 46883 states and 65683 transitions. [2021-11-06 15:23:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-06 15:23:41,025 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:23:41,025 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:23:41,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 15:23:41,026 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:23:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:23:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1231452078, now seen corresponding path program 1 times [2021-11-06 15:23:41,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:23:41,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442741862] [2021-11-06 15:23:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:23:41,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:23:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-06 15:23:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-06 15:23:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-06 15:23:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-06 15:23:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:23:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:23:41,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:23:41,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442741862] [2021-11-06 15:23:41,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442741862] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:23:41,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:23:41,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 15:23:41,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771806945] [2021-11-06 15:23:41,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 15:23:41,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:23:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 15:23:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:23:41,254 INFO L87 Difference]: Start difference. First operand 46883 states and 65683 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:24:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:24:03,425 INFO L93 Difference]: Finished difference Result 94568 states and 132891 transitions. [2021-11-06 15:24:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 15:24:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 135 [2021-11-06 15:24:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:24:03,543 INFO L225 Difference]: With dead ends: 94568 [2021-11-06 15:24:03,543 INFO L226 Difference]: Without dead ends: 47713 [2021-11-06 15:24:03,654 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 15:24:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47713 states. [2021-11-06 15:24:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47713 to 47043. [2021-11-06 15:24:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47043 states, 46396 states have (on average 1.3975989309423227) internal successors, (64843), 46482 states have internal predecessors, (64843), 405 states have call successors, (405), 200 states have call predecessors, (405), 240 states have return successors, (635), 410 states have call predecessors, (635), 405 states have call successors, (635) [2021-11-06 15:24:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47043 states to 47043 states and 65883 transitions. [2021-11-06 15:24:05,011 INFO L78 Accepts]: Start accepts. Automaton has 47043 states and 65883 transitions. Word has length 135 [2021-11-06 15:24:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:24:05,011 INFO L470 AbstractCegarLoop]: Abstraction has 47043 states and 65883 transitions. [2021-11-06 15:24:05,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:24:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 47043 states and 65883 transitions. [2021-11-06 15:24:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-11-06 15:24:05,059 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:24:05,060 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:24:05,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 15:24:05,060 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:24:05,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:24:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash 169280119, now seen corresponding path program 1 times [2021-11-06 15:24:05,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:24:05,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648365273] [2021-11-06 15:24:05,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:24:05,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:24:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-06 15:24:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:05,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-06 15:24:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-06 15:24:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:05,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-06 15:24:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:24:05,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:24:05,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648365273] [2021-11-06 15:24:05,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648365273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:24:05,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:24:05,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 15:24:05,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88066106] [2021-11-06 15:24:05,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 15:24:05,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:24:05,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 15:24:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 15:24:05,578 INFO L87 Difference]: Start difference. First operand 47043 states and 65883 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-06 15:24:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:24:29,963 INFO L93 Difference]: Finished difference Result 75085 states and 105925 transitions. [2021-11-06 15:24:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 15:24:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 132 [2021-11-06 15:24:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:24:30,063 INFO L225 Difference]: With dead ends: 75085 [2021-11-06 15:24:30,064 INFO L226 Difference]: Without dead ends: 48513 [2021-11-06 15:24:30,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-06 15:24:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48513 states. [2021-11-06 15:24:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48513 to 47073. [2021-11-06 15:24:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47073 states, 46426 states have (on average 1.3973420066342135) internal successors, (64873), 46512 states have internal predecessors, (64873), 405 states have call successors, (405), 200 states have call predecessors, (405), 240 states have return successors, (635), 410 states have call predecessors, (635), 405 states have call successors, (635) [2021-11-06 15:24:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47073 states to 47073 states and 65913 transitions. [2021-11-06 15:24:31,347 INFO L78 Accepts]: Start accepts. Automaton has 47073 states and 65913 transitions. Word has length 132 [2021-11-06 15:24:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:24:31,348 INFO L470 AbstractCegarLoop]: Abstraction has 47073 states and 65913 transitions. [2021-11-06 15:24:31,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-06 15:24:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 47073 states and 65913 transitions. [2021-11-06 15:24:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-06 15:24:31,393 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:24:31,394 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:24:31,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 15:24:31,394 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:24:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:24:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1771757657, now seen corresponding path program 1 times [2021-11-06 15:24:31,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:24:31,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794165517] [2021-11-06 15:24:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:24:31,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:24:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-11-06 15:24:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-06 15:24:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-06 15:24:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-06 15:24:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:24:31,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:24:31,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794165517] [2021-11-06 15:24:31,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794165517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:24:31,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:24:31,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:24:31,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046665078] [2021-11-06 15:24:31,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:24:31,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:24:31,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:24:31,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:24:31,631 INFO L87 Difference]: Start difference. First operand 47073 states and 65913 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:24:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:24:56,209 INFO L93 Difference]: Finished difference Result 94758 states and 132581 transitions. [2021-11-06 15:24:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:24:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 135 [2021-11-06 15:24:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:24:56,322 INFO L225 Difference]: With dead ends: 94758 [2021-11-06 15:24:56,322 INFO L226 Difference]: Without dead ends: 47713 [2021-11-06 15:24:56,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:24:56,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47713 states. [2021-11-06 15:24:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47713 to 47053. [2021-11-06 15:24:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47053 states, 46416 states have (on average 1.397212168217856) internal successors, (64853), 46502 states have internal predecessors, (64853), 395 states have call successors, (395), 200 states have call predecessors, (395), 240 states have return successors, (620), 400 states have call predecessors, (620), 395 states have call successors, (620) [2021-11-06 15:24:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47053 states to 47053 states and 65868 transitions. [2021-11-06 15:24:57,878 INFO L78 Accepts]: Start accepts. Automaton has 47053 states and 65868 transitions. Word has length 135 [2021-11-06 15:24:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:24:57,878 INFO L470 AbstractCegarLoop]: Abstraction has 47053 states and 65868 transitions. [2021-11-06 15:24:57,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:24:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 47053 states and 65868 transitions. [2021-11-06 15:24:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-06 15:24:57,925 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:24:57,925 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:24:57,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 15:24:57,925 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:24:57,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:24:57,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1276242804, now seen corresponding path program 1 times [2021-11-06 15:24:57,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:24:57,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386085800] [2021-11-06 15:24:57,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:24:57,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:24:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-06 15:24:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-06 15:24:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:58,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-06 15:24:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-06 15:24:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:24:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:24:58,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:24:58,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386085800] [2021-11-06 15:24:58,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386085800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:24:58,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:24:58,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:24:58,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707404593] [2021-11-06 15:24:58,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:24:58,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:24:58,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:24:58,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:24:58,263 INFO L87 Difference]: Start difference. First operand 47053 states and 65868 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:25:24,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:25:24,330 INFO L93 Difference]: Finished difference Result 94718 states and 132491 transitions. [2021-11-06 15:25:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:25:24,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 137 [2021-11-06 15:25:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:25:24,441 INFO L225 Difference]: With dead ends: 94718 [2021-11-06 15:25:24,442 INFO L226 Difference]: Without dead ends: 47693 [2021-11-06 15:25:24,511 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:25:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47693 states. [2021-11-06 15:25:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47693 to 47033. [2021-11-06 15:25:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47033 states, 46406 states have (on average 1.3970822738438995) internal successors, (64833), 46492 states have internal predecessors, (64833), 385 states have call successors, (385), 200 states have call predecessors, (385), 240 states have return successors, (605), 390 states have call predecessors, (605), 385 states have call successors, (605) [2021-11-06 15:25:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47033 states to 47033 states and 65823 transitions. [2021-11-06 15:25:25,836 INFO L78 Accepts]: Start accepts. Automaton has 47033 states and 65823 transitions. Word has length 137 [2021-11-06 15:25:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:25:25,836 INFO L470 AbstractCegarLoop]: Abstraction has 47033 states and 65823 transitions. [2021-11-06 15:25:25,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:25:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 47033 states and 65823 transitions. [2021-11-06 15:25:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-06 15:25:25,881 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:25:25,881 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:25:25,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 15:25:25,882 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:25:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:25:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 193835782, now seen corresponding path program 1 times [2021-11-06 15:25:25,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:25:25,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537706569] [2021-11-06 15:25:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:25:25,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:25:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-06 15:25:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-06 15:25:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:26,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-06 15:25:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:26,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-06 15:25:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:25:26,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:25:26,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537706569] [2021-11-06 15:25:26,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537706569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:25:26,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:25:26,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:25:26,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080857255] [2021-11-06 15:25:26,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:25:26,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:25:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:25:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:25:26,121 INFO L87 Difference]: Start difference. First operand 47033 states and 65823 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:25:55,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 15:25:55,668 INFO L93 Difference]: Finished difference Result 94678 states and 132401 transitions. [2021-11-06 15:25:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 15:25:55,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 136 [2021-11-06 15:25:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 15:25:55,772 INFO L225 Difference]: With dead ends: 94678 [2021-11-06 15:25:55,772 INFO L226 Difference]: Without dead ends: 47673 [2021-11-06 15:25:55,841 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 15:25:55,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47673 states. [2021-11-06 15:25:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47673 to 47013. [2021-11-06 15:25:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47013 states, 46396 states have (on average 1.3969523234761618) internal successors, (64813), 46482 states have internal predecessors, (64813), 375 states have call successors, (375), 200 states have call predecessors, (375), 240 states have return successors, (590), 380 states have call predecessors, (590), 375 states have call successors, (590) [2021-11-06 15:25:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47013 states to 47013 states and 65778 transitions. [2021-11-06 15:25:57,155 INFO L78 Accepts]: Start accepts. Automaton has 47013 states and 65778 transitions. Word has length 136 [2021-11-06 15:25:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 15:25:57,155 INFO L470 AbstractCegarLoop]: Abstraction has 47013 states and 65778 transitions. [2021-11-06 15:25:57,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-06 15:25:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 47013 states and 65778 transitions. [2021-11-06 15:25:57,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-06 15:25:57,195 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 15:25:57,195 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 15:25:57,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 15:25:57,197 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-06 15:25:57,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 15:25:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1773092941, now seen corresponding path program 1 times [2021-11-06 15:25:57,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 15:25:57,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971870012] [2021-11-06 15:25:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 15:25:57,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 15:25:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-06 15:25:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-06 15:25:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-06 15:25:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:57,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-06 15:25:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 15:25:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 15:25:57,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 15:25:57,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971870012] [2021-11-06 15:25:57,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971870012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 15:25:57,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 15:25:57,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 15:25:57,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063299682] [2021-11-06 15:25:57,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 15:25:57,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 15:25:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 15:25:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 15:25:57,455 INFO L87 Difference]: Start difference. First operand 47013 states and 65778 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)