./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 13:16:41,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 13:16:41,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 13:16:41,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 13:16:41,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 13:16:41,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 13:16:41,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 13:16:41,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 13:16:41,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 13:16:41,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 13:16:41,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 13:16:41,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 13:16:41,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 13:16:41,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 13:16:41,410 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 13:16:41,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 13:16:41,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 13:16:41,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 13:16:41,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 13:16:41,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 13:16:41,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 13:16:41,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 13:16:41,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 13:16:41,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 13:16:41,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 13:16:41,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 13:16:41,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 13:16:41,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 13:16:41,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 13:16:41,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 13:16:41,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 13:16:41,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 13:16:41,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 13:16:41,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 13:16:41,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 13:16:41,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 13:16:41,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 13:16:41,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 13:16:41,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 13:16:41,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 13:16:41,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 13:16:41,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 13:16:41,465 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 13:16:41,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 13:16:41,466 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 13:16:41,466 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 13:16:41,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 13:16:41,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 13:16:41,467 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 13:16:41,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 13:16:41,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 13:16:41,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 13:16:41,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 13:16:41,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 13:16:41,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 13:16:41,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 13:16:41,469 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 13:16:41,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 13:16:41,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 13:16:41,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 13:16:41,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 13:16:41,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 13:16:41,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 13:16:41,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 13:16:41,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 13:16:41,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 13:16:41,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 13:16:41,470 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 13:16:41,471 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 13:16:41,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 13:16:41,471 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 13:16:41,472 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 -> 1b605371288ab675786f884c3e899aa7b22c9968bb31ac2f2bc3b55776b1682d [2021-11-07 13:16:41,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 13:16:41,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 13:16:41,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 13:16:41,677 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 13:16:41,678 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 13:16:41,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2021-11-07 13:16:41,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce30431a/366abc84c42d426fa94c39a6f0c358be/FLAG7ba55669a [2021-11-07 13:16:42,346 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 13:16:42,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2021-11-07 13:16:42,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce30431a/366abc84c42d426fa94c39a6f0c358be/FLAG7ba55669a [2021-11-07 13:16:42,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce30431a/366abc84c42d426fa94c39a6f0c358be [2021-11-07 13:16:42,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 13:16:42,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 13:16:42,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 13:16:42,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 13:16:42,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 13:16:42,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:16:42" (1/1) ... [2021-11-07 13:16:42,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548315ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:42, skipping insertion in model container [2021-11-07 13:16:42,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:16:42" (1/1) ... [2021-11-07 13:16:42,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 13:16:42,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 13:16:43,370 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2021-11-07 13:16:43,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 13:16:43,764 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 13:16:43,898 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i[180577,180590] [2021-11-07 13:16:44,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 13:16:44,072 INFO L208 MainTranslator]: Completed translation [2021-11-07 13:16:44,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44 WrapperNode [2021-11-07 13:16:44,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 13:16:44,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 13:16:44,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 13:16:44,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 13:16:44,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 13:16:44,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 13:16:44,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 13:16:44,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 13:16:44,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 13:16:44,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 13:16:44,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 13:16:44,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 13:16:44,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (1/1) ... [2021-11-07 13:16:44,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 13:16:44,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:16:44,468 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-07 13:16:44,475 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-07 13:16:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 13:16:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 13:16:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 13:16:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 13:16:44,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 13:16:44,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 13:16:54,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 13:16:54,026 INFO L299 CfgBuilder]: Removed 453 assume(true) statements. [2021-11-07 13:16:54,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:16:54 BoogieIcfgContainer [2021-11-07 13:16:54,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 13:16:54,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 13:16:54,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 13:16:54,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 13:16:54,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:16:42" (1/3) ... [2021-11-07 13:16:54,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281c5594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:16:54, skipping insertion in model container [2021-11-07 13:16:54,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:16:44" (2/3) ... [2021-11-07 13:16:54,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281c5594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:16:54, skipping insertion in model container [2021-11-07 13:16:54,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:16:54" (3/3) ... [2021-11-07 13:16:54,040 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--libertas--usb8xxx.ko-entry_point.cil.out.i [2021-11-07 13:16:54,044 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 13:16:54,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 13:16:54,080 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 13:16:54,084 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-07 13:16:54,084 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 13:16:54,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 732 states, 730 states have (on average 1.5232876712328767) internal successors, (1112), 731 states have internal predecessors, (1112), 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-07 13:16:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 13:16:54,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:16:54,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:16:54,114 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:16:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:16:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1244740702, now seen corresponding path program 1 times [2021-11-07 13:16:54,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:16:54,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676363964] [2021-11-07 13:16:54,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:16:54,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:16:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:16:54,637 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-07 13:16:54,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:16:54,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676363964] [2021-11-07 13:16:54,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676363964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:16:54,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:16:54,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:16:54,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865332724] [2021-11-07 13:16:54,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:16:54,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:16:54,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:16:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:16:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:54,661 INFO L87 Difference]: Start difference. First operand has 732 states, 730 states have (on average 1.5232876712328767) internal successors, (1112), 731 states have internal predecessors, (1112), 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) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07 13:16:56,719 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:16:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:16:56,959 INFO L93 Difference]: Finished difference Result 2159 states and 3291 transitions. [2021-11-07 13:16:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:16:56,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2021-11-07 13:16:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:16:56,980 INFO L225 Difference]: With dead ends: 2159 [2021-11-07 13:16:56,980 INFO L226 Difference]: Without dead ends: 1420 [2021-11-07 13:16:56,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.70ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:56,990 INFO L933 BasicCegarLoop]: 1088 mSDtfsCounter, 1056 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2082.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.72ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2194.65ms IncrementalHoareTripleChecker+Time [2021-11-07 13:16:56,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 2155 Invalid, 16 Unknown, 0 Unchecked, 9.72ms Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 2194.65ms Time] [2021-11-07 13:16:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-11-07 13:16:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2021-11-07 13:16:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1419 states have (on average 1.4940098661028893) internal successors, (2120), 1419 states have internal predecessors, (2120), 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-07 13:16:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2120 transitions. [2021-11-07 13:16:57,079 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2120 transitions. Word has length 20 [2021-11-07 13:16:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:16:57,079 INFO L470 AbstractCegarLoop]: Abstraction has 1420 states and 2120 transitions. [2021-11-07 13:16:57,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-07 13:16:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2120 transitions. [2021-11-07 13:16:57,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 13:16:57,087 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:16:57,087 INFO L514 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] [2021-11-07 13:16:57,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 13:16:57,088 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:16:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:16:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash 104665615, now seen corresponding path program 1 times [2021-11-07 13:16:57,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:16:57,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345632389] [2021-11-07 13:16:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:16:57,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:16:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:16:57,297 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-07 13:16:57,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:16:57,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345632389] [2021-11-07 13:16:57,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345632389] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:16:57,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:16:57,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:16:57,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423509036] [2021-11-07 13:16:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:16:57,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:16:57,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:16:57,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:16:57,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:57,305 INFO L87 Difference]: Start difference. First operand 1420 states and 2120 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-07 13:16:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:16:57,380 INFO L93 Difference]: Finished difference Result 1430 states and 2128 transitions. [2021-11-07 13:16:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:16:57,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-11-07 13:16:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:16:57,386 INFO L225 Difference]: With dead ends: 1430 [2021-11-07 13:16:57,386 INFO L226 Difference]: Without dead ends: 1425 [2021-11-07 13:16:57,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.90ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:57,388 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 1072 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.07ms IncrementalHoareTripleChecker+Time [2021-11-07 13:16:57,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1072 Valid, 1084 Invalid, 6 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 52.07ms Time] [2021-11-07 13:16:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2021-11-07 13:16:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1420. [2021-11-07 13:16:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1420 states, 1419 states have (on average 1.4933051444679353) internal successors, (2119), 1419 states have internal predecessors, (2119), 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-07 13:16:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 2119 transitions. [2021-11-07 13:16:57,415 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 2119 transitions. Word has length 27 [2021-11-07 13:16:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:16:57,416 INFO L470 AbstractCegarLoop]: Abstraction has 1420 states and 2119 transitions. [2021-11-07 13:16:57,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-07 13:16:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 2119 transitions. [2021-11-07 13:16:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 13:16:57,418 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:16:57,418 INFO L514 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] [2021-11-07 13:16:57,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 13:16:57,420 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:16:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:16:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 161923917, now seen corresponding path program 1 times [2021-11-07 13:16:57,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:16:57,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942384402] [2021-11-07 13:16:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:16:57,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:16:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:16:57,648 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-07 13:16:57,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:16:57,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942384402] [2021-11-07 13:16:57,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942384402] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:16:57,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:16:57,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 13:16:57,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800894278] [2021-11-07 13:16:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:16:57,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:16:57,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:16:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:16:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:16:57,650 INFO L87 Difference]: Start difference. First operand 1420 states and 2119 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-07 13:16:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:16:58,087 INFO L93 Difference]: Finished difference Result 4236 states and 6330 transitions. [2021-11-07 13:16:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 13:16:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2021-11-07 13:16:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:16:58,097 INFO L225 Difference]: With dead ends: 4236 [2021-11-07 13:16:58,098 INFO L226 Difference]: Without dead ends: 2822 [2021-11-07 13:16:58,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.54ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:16:58,105 INFO L933 BasicCegarLoop]: 1061 mSDtfsCounter, 1049 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 278.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.10ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 308.37ms IncrementalHoareTripleChecker+Time [2021-11-07 13:16:58,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1049 Valid, 4227 Invalid, 77 Unknown, 0 Unchecked, 6.10ms Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 308.37ms Time] [2021-11-07 13:16:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2021-11-07 13:16:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2806. [2021-11-07 13:16:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2806 states, 2805 states have (on average 1.494830659536542) internal successors, (4193), 2805 states have internal predecessors, (4193), 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-07 13:16:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2806 states to 2806 states and 4193 transitions. [2021-11-07 13:16:58,165 INFO L78 Accepts]: Start accepts. Automaton has 2806 states and 4193 transitions. Word has length 27 [2021-11-07 13:16:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:16:58,166 INFO L470 AbstractCegarLoop]: Abstraction has 2806 states and 4193 transitions. [2021-11-07 13:16:58,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-07 13:16:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2806 states and 4193 transitions. [2021-11-07 13:16:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-07 13:16:58,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:16:58,172 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:16:58,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 13:16:58,173 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:16:58,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:16:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash 944060928, now seen corresponding path program 1 times [2021-11-07 13:16:58,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:16:58,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207092655] [2021-11-07 13:16:58,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:16:58,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:16:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:16:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:16:58,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:16:58,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207092655] [2021-11-07 13:16:58,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207092655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:16:58,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:16:58,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:16:58,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477642931] [2021-11-07 13:16:58,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:16:58,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:16:58,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:16:58,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:16:58,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:58,331 INFO L87 Difference]: Start difference. First operand 2806 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-07 13:16:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:16:58,526 INFO L93 Difference]: Finished difference Result 5933 states and 8897 transitions. [2021-11-07 13:16:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:16:58,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2021-11-07 13:16:58,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:16:58,536 INFO L225 Difference]: With dead ends: 5933 [2021-11-07 13:16:58,536 INFO L226 Difference]: Without dead ends: 3138 [2021-11-07 13:16:58,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.34ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:58,541 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 142 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.82ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 138.46ms IncrementalHoareTripleChecker+Time [2021-11-07 13:16:58,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 2121 Invalid, 24 Unknown, 0 Unchecked, 1.82ms Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 138.46ms Time] [2021-11-07 13:16:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2021-11-07 13:16:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3128. [2021-11-07 13:16:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3128 states, 3127 states have (on average 1.5043172369683402) internal successors, (4704), 3127 states have internal predecessors, (4704), 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-07 13:16:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 4704 transitions. [2021-11-07 13:16:58,613 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 4704 transitions. Word has length 57 [2021-11-07 13:16:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:16:58,613 INFO L470 AbstractCegarLoop]: Abstraction has 3128 states and 4704 transitions. [2021-11-07 13:16:58,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-07 13:16:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 4704 transitions. [2021-11-07 13:16:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 13:16:58,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:16:58,617 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:16:58,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 13:16:58,618 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:16:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:16:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1782814012, now seen corresponding path program 1 times [2021-11-07 13:16:58,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:16:58,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117844719] [2021-11-07 13:16:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:16:58,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:16:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:16:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:16:58,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:16:58,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117844719] [2021-11-07 13:16:58,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117844719] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:16:58,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:16:58,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:16:58,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624677321] [2021-11-07 13:16:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:16:58,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:16:58,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:16:58,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:16:58,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:16:58,783 INFO L87 Difference]: Start difference. First operand 3128 states and 4704 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-07 13:17:00,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:01,103 INFO L93 Difference]: Finished difference Result 6629 states and 10015 transitions. [2021-11-07 13:17:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:17:01,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2021-11-07 13:17:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:01,114 INFO L225 Difference]: With dead ends: 6629 [2021-11-07 13:17:01,114 INFO L226 Difference]: Without dead ends: 3512 [2021-11-07 13:17:01,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:01,120 INFO L933 BasicCegarLoop]: 1203 mSDtfsCounter, 591 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2119.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.39ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2245.86ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:01,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 1803 Invalid, 37 Unknown, 0 Unchecked, 2.39ms Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 1 Unknown, 0 Unchecked, 2245.86ms Time] [2021-11-07 13:17:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2021-11-07 13:17:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3502. [2021-11-07 13:17:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 3501 states have (on average 1.5101399600114254) internal successors, (5287), 3501 states have internal predecessors, (5287), 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-07 13:17:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 5287 transitions. [2021-11-07 13:17:01,203 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 5287 transitions. Word has length 65 [2021-11-07 13:17:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:01,207 INFO L470 AbstractCegarLoop]: Abstraction has 3502 states and 5287 transitions. [2021-11-07 13:17:01,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-07 13:17:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 5287 transitions. [2021-11-07 13:17:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-07 13:17:01,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:01,212 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-11-07 13:17:01,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 13:17:01,212 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2010505363, now seen corresponding path program 1 times [2021-11-07 13:17:01,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:01,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551817563] [2021-11-07 13:17:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:01,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 13:17:01,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:01,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551817563] [2021-11-07 13:17:01,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551817563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:01,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:01,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:17:01,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125010273] [2021-11-07 13:17:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:01,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:17:01,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:17:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:01,417 INFO L87 Difference]: Start difference. First operand 3502 states and 5287 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-07 13:17:03,454 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:03,735 INFO L93 Difference]: Finished difference Result 7372 states and 11177 transitions. [2021-11-07 13:17:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:17:03,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 82 [2021-11-07 13:17:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:03,747 INFO L225 Difference]: With dead ends: 7372 [2021-11-07 13:17:03,747 INFO L226 Difference]: Without dead ends: 3881 [2021-11-07 13:17:03,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.20ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:03,753 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 279 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2117.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.58ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2244.63ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:03,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 2133 Invalid, 38 Unknown, 0 Unchecked, 2.58ms Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 2244.63ms Time] [2021-11-07 13:17:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2021-11-07 13:17:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3876. [2021-11-07 13:17:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3875 states have (on average 1.5158709677419355) internal successors, (5874), 3875 states have internal predecessors, (5874), 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-07 13:17:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 5874 transitions. [2021-11-07 13:17:03,834 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 5874 transitions. Word has length 82 [2021-11-07 13:17:03,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:03,835 INFO L470 AbstractCegarLoop]: Abstraction has 3876 states and 5874 transitions. [2021-11-07 13:17:03,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-07 13:17:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 5874 transitions. [2021-11-07 13:17:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-07 13:17:03,839 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:03,840 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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-07 13:17:03,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 13:17:03,840 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2103832470, now seen corresponding path program 1 times [2021-11-07 13:17:03,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:03,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610524218] [2021-11-07 13:17:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:03,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 13:17:04,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:04,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610524218] [2021-11-07 13:17:04,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610524218] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:04,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:04,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 13:17:04,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362147442] [2021-11-07 13:17:04,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:04,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:17:04,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:17:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:17:04,046 INFO L87 Difference]: Start difference. First operand 3876 states and 5874 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-07 13:17:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:04,408 INFO L93 Difference]: Finished difference Result 18669 states and 28376 transitions. [2021-11-07 13:17:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 13:17:04,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 101 [2021-11-07 13:17:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:04,452 INFO L225 Difference]: With dead ends: 18669 [2021-11-07 13:17:04,452 INFO L226 Difference]: Without dead ends: 14804 [2021-11-07 13:17:04,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.49ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:04,463 INFO L933 BasicCegarLoop]: 1956 mSDtfsCounter, 3092 mSDsluCounter, 3013 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 4969 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.27ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 109.33ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:04,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3092 Valid, 4969 Invalid, 43 Unknown, 0 Unchecked, 12.27ms Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 109.33ms Time] [2021-11-07 13:17:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14804 states. [2021-11-07 13:17:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14804 to 3892. [2021-11-07 13:17:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 1.5137496787458238) internal successors, (5890), 3891 states have internal predecessors, (5890), 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-07 13:17:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5890 transitions. [2021-11-07 13:17:04,632 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5890 transitions. Word has length 101 [2021-11-07 13:17:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:04,633 INFO L470 AbstractCegarLoop]: Abstraction has 3892 states and 5890 transitions. [2021-11-07 13:17:04,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-07 13:17:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5890 transitions. [2021-11-07 13:17:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-07 13:17:04,641 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:04,642 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2021-11-07 13:17:04,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 13:17:04,642 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash -343794334, now seen corresponding path program 1 times [2021-11-07 13:17:04,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:04,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680556405] [2021-11-07 13:17:04,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:04,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 13:17:04,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:04,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680556405] [2021-11-07 13:17:04,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680556405] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:04,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:04,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 13:17:04,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811525159] [2021-11-07 13:17:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:04,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:17:04,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:17:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:17:04,869 INFO L87 Difference]: Start difference. First operand 3892 states and 5890 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-07 13:17:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:05,121 INFO L93 Difference]: Finished difference Result 9406 states and 14264 transitions. [2021-11-07 13:17:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 13:17:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 104 [2021-11-07 13:17:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:05,134 INFO L225 Difference]: With dead ends: 9406 [2021-11-07 13:17:05,135 INFO L226 Difference]: Without dead ends: 5525 [2021-11-07 13:17:05,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.52ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:05,143 INFO L933 BasicCegarLoop]: 1909 mSDtfsCounter, 1920 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.90ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.61ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:05,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1920 Valid, 2968 Invalid, 10 Unknown, 0 Unchecked, 4.90ms Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 71.61ms Time] [2021-11-07 13:17:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2021-11-07 13:17:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 3892. [2021-11-07 13:17:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3891 states have (on average 1.51272166538165) internal successors, (5886), 3891 states have internal predecessors, (5886), 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-07 13:17:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5886 transitions. [2021-11-07 13:17:05,281 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5886 transitions. Word has length 104 [2021-11-07 13:17:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:05,282 INFO L470 AbstractCegarLoop]: Abstraction has 3892 states and 5886 transitions. [2021-11-07 13:17:05,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-07 13:17:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5886 transitions. [2021-11-07 13:17:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-07 13:17:05,288 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:05,288 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2021-11-07 13:17:05,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 13:17:05,289 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash 243011680, now seen corresponding path program 1 times [2021-11-07 13:17:05,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:05,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814232748] [2021-11-07 13:17:05,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:05,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-07 13:17:05,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:05,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814232748] [2021-11-07 13:17:05,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814232748] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:17:05,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977349698] [2021-11-07 13:17:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:05,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:17:05,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:17:05,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 13:17:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:06,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 2910 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 13:17:06,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:17:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-07 13:17:06,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 13:17:06,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977349698] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:06,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 13:17:06,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-07 13:17:06,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889932592] [2021-11-07 13:17:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:06,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:17:06,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:17:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:17:06,942 INFO L87 Difference]: Start difference. First operand 3892 states and 5886 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-07 13:17:08,982 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:09,409 INFO L93 Difference]: Finished difference Result 10124 states and 15271 transitions. [2021-11-07 13:17:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 13:17:09,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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 104 [2021-11-07 13:17:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:09,420 INFO L225 Difference]: With dead ends: 10124 [2021-11-07 13:17:09,420 INFO L226 Difference]: Without dead ends: 6243 [2021-11-07 13:17:09,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 183.87ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-07 13:17:09,427 INFO L933 BasicCegarLoop]: 1678 mSDtfsCounter, 1512 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2102.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 5175 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.92ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2242.75ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:09,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1512 Valid, 5175 Invalid, 27 Unknown, 0 Unchecked, 5.92ms Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 2242.75ms Time] [2021-11-07 13:17:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2021-11-07 13:17:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 4276. [2021-11-07 13:17:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.5097076023391813) internal successors, (6454), 4275 states have internal predecessors, (6454), 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-07 13:17:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 6454 transitions. [2021-11-07 13:17:09,538 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 6454 transitions. Word has length 104 [2021-11-07 13:17:09,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:09,538 INFO L470 AbstractCegarLoop]: Abstraction has 4276 states and 6454 transitions. [2021-11-07 13:17:09,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-07 13:17:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 6454 transitions. [2021-11-07 13:17:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-07 13:17:09,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:09,543 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2021-11-07 13:17:09,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 13:17:09,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:09,759 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1970201798, now seen corresponding path program 1 times [2021-11-07 13:17:09,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:09,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893373156] [2021-11-07 13:17:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:09,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-07 13:17:09,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:09,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893373156] [2021-11-07 13:17:09,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893373156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:09,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:09,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:17:09,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259528137] [2021-11-07 13:17:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:09,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:17:09,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:17:09,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:09,927 INFO L87 Difference]: Start difference. First operand 4276 states and 6454 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-07 13:17:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:10,023 INFO L93 Difference]: Finished difference Result 8545 states and 12903 transitions. [2021-11-07 13:17:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:17:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 136 [2021-11-07 13:17:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:10,064 INFO L225 Difference]: With dead ends: 8545 [2021-11-07 13:17:10,064 INFO L226 Difference]: Without dead ends: 4280 [2021-11-07 13:17:10,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:10,072 INFO L933 BasicCegarLoop]: 1075 mSDtfsCounter, 0 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.23ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:10,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2145 Invalid, 6 Unknown, 0 Unchecked, 1.88ms Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 15.23ms Time] [2021-11-07 13:17:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2021-11-07 13:17:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2021-11-07 13:17:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.509231128768404) internal successors, (6458), 4279 states have internal predecessors, (6458), 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-07 13:17:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 6458 transitions. [2021-11-07 13:17:10,208 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 6458 transitions. Word has length 136 [2021-11-07 13:17:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:10,208 INFO L470 AbstractCegarLoop]: Abstraction has 4280 states and 6458 transitions. [2021-11-07 13:17:10,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-07 13:17:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 6458 transitions. [2021-11-07 13:17:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-07 13:17:10,214 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:10,214 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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] [2021-11-07 13:17:10,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 13:17:10,215 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:10,215 INFO L85 PathProgramCache]: Analyzing trace with hash 29619784, now seen corresponding path program 1 times [2021-11-07 13:17:10,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:10,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601026396] [2021-11-07 13:17:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:10,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-07 13:17:10,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:10,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601026396] [2021-11-07 13:17:10,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601026396] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:17:10,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383449347] [2021-11-07 13:17:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:10,528 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:10,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:17:10,530 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:17:10,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 13:17:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:11,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 3238 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 13:17:11,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:17:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-07 13:17:12,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 13:17:12,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383449347] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:12,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 13:17:12,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-07 13:17:12,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416906348] [2021-11-07 13:17:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:12,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:17:12,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:17:12,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:12,202 INFO L87 Difference]: Start difference. First operand 4280 states and 6458 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-07 13:17:14,242 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:14,510 INFO L93 Difference]: Finished difference Result 6344 states and 9544 transitions. [2021-11-07 13:17:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 13:17:14,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 136 [2021-11-07 13:17:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:14,523 INFO L225 Difference]: With dead ends: 6344 [2021-11-07 13:17:14,524 INFO L226 Difference]: Without dead ends: 6337 [2021-11-07 13:17:14,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.70ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:14,528 INFO L933 BasicCegarLoop]: 1671 mSDtfsCounter, 2023 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2066.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.31ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2177.82ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:14,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2023 Valid, 2289 Invalid, 17 Unknown, 0 Unchecked, 4.31ms Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 2177.82ms Time] [2021-11-07 13:17:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2021-11-07 13:17:14,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5266. [2021-11-07 13:17:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5266 states, 5265 states have (on average 1.5061728395061729) internal successors, (7930), 5265 states have internal predecessors, (7930), 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-07 13:17:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5266 states to 5266 states and 7930 transitions. [2021-11-07 13:17:14,667 INFO L78 Accepts]: Start accepts. Automaton has 5266 states and 7930 transitions. Word has length 136 [2021-11-07 13:17:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:14,667 INFO L470 AbstractCegarLoop]: Abstraction has 5266 states and 7930 transitions. [2021-11-07 13:17:14,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-07 13:17:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5266 states and 7930 transitions. [2021-11-07 13:17:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-07 13:17:14,674 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:14,674 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 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, 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-07 13:17:14,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 13:17:14,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-07 13:17:14,887 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1495766553, now seen corresponding path program 1 times [2021-11-07 13:17:14,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:14,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63549916] [2021-11-07 13:17:14,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:14,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-07 13:17:15,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:15,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63549916] [2021-11-07 13:17:15,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63549916] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:17:15,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785953199] [2021-11-07 13:17:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:15,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:17:15,247 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:17:15,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-07 13:17:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:15,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 3313 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 13:17:15,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:17:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 13:17:16,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 13:17:16,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785953199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:16,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 13:17:16,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-07 13:17:16,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891230909] [2021-11-07 13:17:16,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:16,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:17:16,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:16,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:17:16,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:17:16,556 INFO L87 Difference]: Start difference. First operand 5266 states and 7930 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-07 13:17:18,591 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:18,882 INFO L93 Difference]: Finished difference Result 10521 states and 15847 transitions. [2021-11-07 13:17:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:17:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 143 [2021-11-07 13:17:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:18,890 INFO L225 Difference]: With dead ends: 10521 [2021-11-07 13:17:18,890 INFO L226 Difference]: Without dead ends: 5104 [2021-11-07 13:17:18,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 121.82ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:17:18,897 INFO L933 BasicCegarLoop]: 1197 mSDtfsCounter, 948 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2058.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2195.55ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:18,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [948 Valid, 2261 Invalid, 12 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 2195.55ms Time] [2021-11-07 13:17:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2021-11-07 13:17:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5104. [2021-11-07 13:17:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5104 states, 5103 states have (on average 1.5002939447383892) internal successors, (7656), 5103 states have internal predecessors, (7656), 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-07 13:17:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 7656 transitions. [2021-11-07 13:17:19,016 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 7656 transitions. Word has length 143 [2021-11-07 13:17:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:19,017 INFO L470 AbstractCegarLoop]: Abstraction has 5104 states and 7656 transitions. [2021-11-07 13:17:19,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-07 13:17:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 7656 transitions. [2021-11-07 13:17:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-07 13:17:19,022 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:19,022 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 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, 1, 1, 1, 1, 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-07 13:17:19,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-07 13:17:19,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:19,233 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash 748791845, now seen corresponding path program 1 times [2021-11-07 13:17:19,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:19,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682660522] [2021-11-07 13:17:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:19,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-07 13:17:19,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:19,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682660522] [2021-11-07 13:17:19,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682660522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:19,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:19,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:17:19,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048707603] [2021-11-07 13:17:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:19,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:17:19,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:17:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:19,349 INFO L87 Difference]: Start difference. First operand 5104 states and 7656 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-07 13:17:21,385 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:21,552 INFO L93 Difference]: Finished difference Result 7651 states and 11475 transitions. [2021-11-07 13:17:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:17:21,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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 143 [2021-11-07 13:17:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:21,557 INFO L225 Difference]: With dead ends: 7651 [2021-11-07 13:17:21,557 INFO L226 Difference]: Without dead ends: 2557 [2021-11-07 13:17:21,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.95ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:21,562 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 0 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2039.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2144.93ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:21,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2143 Invalid, 4 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2144.93ms Time] [2021-11-07 13:17:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2021-11-07 13:17:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2021-11-07 13:17:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.498435054773083) internal successors, (3830), 2556 states have internal predecessors, (3830), 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-07 13:17:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3830 transitions. [2021-11-07 13:17:21,658 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3830 transitions. Word has length 143 [2021-11-07 13:17:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:21,658 INFO L470 AbstractCegarLoop]: Abstraction has 2557 states and 3830 transitions. [2021-11-07 13:17:21,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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-07 13:17:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3830 transitions. [2021-11-07 13:17:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-07 13:17:21,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:21,662 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:21,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 13:17:21,662 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash -58519242, now seen corresponding path program 1 times [2021-11-07 13:17:21,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:21,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427125358] [2021-11-07 13:17:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:21,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-07 13:17:22,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:22,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427125358] [2021-11-07 13:17:22,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427125358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:22,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:22,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 13:17:22,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171972823] [2021-11-07 13:17:22,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:22,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:17:22,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:22,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:17:22,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:22,012 INFO L87 Difference]: Start difference. First operand 2557 states and 3830 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-07 13:17:24,049 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:24,393 INFO L93 Difference]: Finished difference Result 6418 states and 9623 transitions. [2021-11-07 13:17:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 13:17:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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 165 [2021-11-07 13:17:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:24,402 INFO L225 Difference]: With dead ends: 6418 [2021-11-07 13:17:24,402 INFO L226 Difference]: Without dead ends: 3964 [2021-11-07 13:17:24,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.89ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:17:24,408 INFO L933 BasicCegarLoop]: 1801 mSDtfsCounter, 2142 mSDsluCounter, 3294 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2114.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 5095 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2225.62ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:24,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2142 Valid, 5095 Invalid, 27 Unknown, 0 Unchecked, 3.77ms Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 2225.62ms Time] [2021-11-07 13:17:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2021-11-07 13:17:24,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 2585. [2021-11-07 13:17:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 2584 states have (on average 1.498452012383901) internal successors, (3872), 2584 states have internal predecessors, (3872), 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-07 13:17:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3872 transitions. [2021-11-07 13:17:24,515 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3872 transitions. Word has length 165 [2021-11-07 13:17:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:24,516 INFO L470 AbstractCegarLoop]: Abstraction has 2585 states and 3872 transitions. [2021-11-07 13:17:24,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-07 13:17:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3872 transitions. [2021-11-07 13:17:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-07 13:17:24,520 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:24,520 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:24,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 13:17:24,521 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2072457957, now seen corresponding path program 1 times [2021-11-07 13:17:24,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:24,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573453841] [2021-11-07 13:17:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:24,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-07 13:17:25,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:25,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573453841] [2021-11-07 13:17:25,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573453841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:25,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:25,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 13:17:25,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973366403] [2021-11-07 13:17:25,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:25,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 13:17:25,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 13:17:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:17:25,014 INFO L87 Difference]: Start difference. First operand 2585 states and 3872 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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-07 13:17:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:25,901 INFO L93 Difference]: Finished difference Result 11284 states and 16902 transitions. [2021-11-07 13:17:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 13:17:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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 167 [2021-11-07 13:17:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:25,917 INFO L225 Difference]: With dead ends: 11284 [2021-11-07 13:17:25,917 INFO L226 Difference]: Without dead ends: 8802 [2021-11-07 13:17:25,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 364.52ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-07 13:17:25,924 INFO L933 BasicCegarLoop]: 1300 mSDtfsCounter, 5272 mSDsluCounter, 6611 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 328.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5272 SdHoareTripleChecker+Valid, 7911 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.81ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 355.27ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:25,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5272 Valid, 7911 Invalid, 110 Unknown, 0 Unchecked, 7.81ms Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 355.27ms Time] [2021-11-07 13:17:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8802 states. [2021-11-07 13:17:26,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8802 to 2600. [2021-11-07 13:17:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2599 states have (on average 1.4955752212389382) internal successors, (3887), 2599 states have internal predecessors, (3887), 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-07 13:17:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3887 transitions. [2021-11-07 13:17:26,033 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3887 transitions. Word has length 167 [2021-11-07 13:17:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:26,033 INFO L470 AbstractCegarLoop]: Abstraction has 2600 states and 3887 transitions. [2021-11-07 13:17:26,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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-07 13:17:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3887 transitions. [2021-11-07 13:17:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-11-07 13:17:26,038 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:26,038 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:26,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 13:17:26,038 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 463025079, now seen corresponding path program 1 times [2021-11-07 13:17:26,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:26,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715175292] [2021-11-07 13:17:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:26,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-07 13:17:26,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:26,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715175292] [2021-11-07 13:17:26,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715175292] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:26,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:26,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 13:17:26,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907916869] [2021-11-07 13:17:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:26,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:17:26,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:17:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:26,406 INFO L87 Difference]: Start difference. First operand 2600 states and 3887 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-07 13:17:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:26,929 INFO L93 Difference]: Finished difference Result 11887 states and 17793 transitions. [2021-11-07 13:17:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 13:17:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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 169 [2021-11-07 13:17:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:26,945 INFO L225 Difference]: With dead ends: 11887 [2021-11-07 13:17:26,945 INFO L226 Difference]: Without dead ends: 9390 [2021-11-07 13:17:26,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.92ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:17:26,950 INFO L933 BasicCegarLoop]: 1595 mSDtfsCounter, 3755 mSDsluCounter, 4259 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 167.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 5854 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.03ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.60ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:26,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3755 Valid, 5854 Invalid, 67 Unknown, 0 Unchecked, 5.03ms Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 181.60ms Time] [2021-11-07 13:17:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2021-11-07 13:17:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 2609. [2021-11-07 13:17:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2608 states have (on average 1.4938650306748467) internal successors, (3896), 2608 states have internal predecessors, (3896), 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-07 13:17:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3896 transitions. [2021-11-07 13:17:27,095 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3896 transitions. Word has length 169 [2021-11-07 13:17:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:27,095 INFO L470 AbstractCegarLoop]: Abstraction has 2609 states and 3896 transitions. [2021-11-07 13:17:27,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 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-07 13:17:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3896 transitions. [2021-11-07 13:17:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-07 13:17:27,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:27,099 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:27,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 13:17:27,099 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:27,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2073944685, now seen corresponding path program 1 times [2021-11-07 13:17:27,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:27,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10122502] [2021-11-07 13:17:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:27,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-07 13:17:27,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:27,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10122502] [2021-11-07 13:17:27,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10122502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:27,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:27,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 13:17:27,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718204894] [2021-11-07 13:17:27,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:27,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:17:27,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:27,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:17:27,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:27,443 INFO L87 Difference]: Start difference. First operand 2609 states and 3896 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-07 13:17:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:27,919 INFO L93 Difference]: Finished difference Result 8719 states and 13049 transitions. [2021-11-07 13:17:27,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 13:17:27,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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 171 [2021-11-07 13:17:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:27,930 INFO L225 Difference]: With dead ends: 8719 [2021-11-07 13:17:27,931 INFO L226 Difference]: Without dead ends: 6213 [2021-11-07 13:17:27,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 123.89ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:17:27,934 INFO L933 BasicCegarLoop]: 1793 mSDtfsCounter, 1739 mSDsluCounter, 4273 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 181.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 6066 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.28ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 192.57ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:27,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1739 Valid, 6066 Invalid, 65 Unknown, 0 Unchecked, 4.28ms Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 192.57ms Time] [2021-11-07 13:17:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6213 states. [2021-11-07 13:17:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6213 to 2618. [2021-11-07 13:17:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2617 states have (on average 1.492166602980512) internal successors, (3905), 2617 states have internal predecessors, (3905), 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-07 13:17:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3905 transitions. [2021-11-07 13:17:28,046 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3905 transitions. Word has length 171 [2021-11-07 13:17:28,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:28,046 INFO L470 AbstractCegarLoop]: Abstraction has 2618 states and 3905 transitions. [2021-11-07 13:17:28,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 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-07 13:17:28,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3905 transitions. [2021-11-07 13:17:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-07 13:17:28,050 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:28,050 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:28,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 13:17:28,051 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1044890223, now seen corresponding path program 1 times [2021-11-07 13:17:28,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:28,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931332886] [2021-11-07 13:17:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:28,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-07 13:17:28,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:28,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931332886] [2021-11-07 13:17:28,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931332886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:28,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:28,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 13:17:28,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576361558] [2021-11-07 13:17:28,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:28,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 13:17:28,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 13:17:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 13:17:28,407 INFO L87 Difference]: Start difference. First operand 2618 states and 3905 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-07 13:17:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:28,888 INFO L93 Difference]: Finished difference Result 7568 states and 11313 transitions. [2021-11-07 13:17:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 13:17:28,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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 173 [2021-11-07 13:17:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:28,893 INFO L225 Difference]: With dead ends: 7568 [2021-11-07 13:17:28,893 INFO L226 Difference]: Without dead ends: 5053 [2021-11-07 13:17:28,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 177.00ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 13:17:28,896 INFO L933 BasicCegarLoop]: 1301 mSDtfsCounter, 1436 mSDsluCounter, 4853 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 178.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 6154 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.23ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 191.40ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:28,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1436 Valid, 6154 Invalid, 78 Unknown, 0 Unchecked, 4.23ms Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 191.40ms Time] [2021-11-07 13:17:28,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states. [2021-11-07 13:17:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 2630. [2021-11-07 13:17:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 2629 states have (on average 1.489920121719285) internal successors, (3917), 2629 states have internal predecessors, (3917), 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-07 13:17:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3917 transitions. [2021-11-07 13:17:29,001 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3917 transitions. Word has length 173 [2021-11-07 13:17:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:29,001 INFO L470 AbstractCegarLoop]: Abstraction has 2630 states and 3917 transitions. [2021-11-07 13:17:29,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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-07 13:17:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3917 transitions. [2021-11-07 13:17:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-07 13:17:29,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:29,005 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:29,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 13:17:29,005 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1221041589, now seen corresponding path program 1 times [2021-11-07 13:17:29,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:29,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665399945] [2021-11-07 13:17:29,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:29,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-07 13:17:29,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:29,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665399945] [2021-11-07 13:17:29,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665399945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:29,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:29,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 13:17:29,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957263606] [2021-11-07 13:17:29,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:29,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:17:29,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:29,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:17:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:17:29,332 INFO L87 Difference]: Start difference. First operand 2630 states and 3917 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-07 13:17:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:29,862 INFO L93 Difference]: Finished difference Result 9079 states and 13565 transitions. [2021-11-07 13:17:29,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 13:17:29,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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 175 [2021-11-07 13:17:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:29,870 INFO L225 Difference]: With dead ends: 9079 [2021-11-07 13:17:29,870 INFO L226 Difference]: Without dead ends: 6552 [2021-11-07 13:17:29,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 102.42ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:17:29,874 INFO L933 BasicCegarLoop]: 1727 mSDtfsCounter, 2238 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 206.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 6446 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.82ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 221.74ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:29,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2238 Valid, 6446 Invalid, 76 Unknown, 0 Unchecked, 4.82ms Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 221.74ms Time] [2021-11-07 13:17:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2021-11-07 13:17:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 2639. [2021-11-07 13:17:30,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2638 states have (on average 1.488248673237301) internal successors, (3926), 2638 states have internal predecessors, (3926), 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-07 13:17:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3926 transitions. [2021-11-07 13:17:30,003 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3926 transitions. Word has length 175 [2021-11-07 13:17:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:30,004 INFO L470 AbstractCegarLoop]: Abstraction has 2639 states and 3926 transitions. [2021-11-07 13:17:30,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 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-07 13:17:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3926 transitions. [2021-11-07 13:17:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-07 13:17:30,007 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:30,007 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:30,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 13:17:30,008 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -181237521, now seen corresponding path program 1 times [2021-11-07 13:17:30,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:30,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367763222] [2021-11-07 13:17:30,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:30,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-07 13:17:30,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:30,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367763222] [2021-11-07 13:17:30,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367763222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:30,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:17:30,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:17:30,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137609106] [2021-11-07 13:17:30,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:30,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:17:30,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:17:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:30,376 INFO L87 Difference]: Start difference. First operand 2639 states and 3926 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-07 13:17:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:30,481 INFO L93 Difference]: Finished difference Result 5270 states and 7843 transitions. [2021-11-07 13:17:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:17:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 177 [2021-11-07 13:17:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:30,485 INFO L225 Difference]: With dead ends: 5270 [2021-11-07 13:17:30,485 INFO L226 Difference]: Without dead ends: 2640 [2021-11-07 13:17:30,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:17:30,489 INFO L933 BasicCegarLoop]: 1072 mSDtfsCounter, 0 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2142 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.07ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.91ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:30,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2142 Invalid, 3 Unknown, 0 Unchecked, 1.07ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 9.91ms Time] [2021-11-07 13:17:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2021-11-07 13:17:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 2640. [2021-11-07 13:17:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.4880636604774535) internal successors, (3927), 2639 states have internal predecessors, (3927), 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-07 13:17:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3927 transitions. [2021-11-07 13:17:30,597 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3927 transitions. Word has length 177 [2021-11-07 13:17:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:30,597 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3927 transitions. [2021-11-07 13:17:30,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-07 13:17:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3927 transitions. [2021-11-07 13:17:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-07 13:17:30,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:30,600 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:30,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 13:17:30,601 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1457598882, now seen corresponding path program 1 times [2021-11-07 13:17:30,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:30,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642051331] [2021-11-07 13:17:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:30,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-07 13:17:31,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:31,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642051331] [2021-11-07 13:17:31,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642051331] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:17:31,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366602102] [2021-11-07 13:17:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:31,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:17:31,050 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:17:31,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-07 13:17:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:31,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 3576 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 13:17:31,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:17:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-07 13:17:32,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 13:17:32,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366602102] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:17:32,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 13:17:32,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-07 13:17:32,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558432874] [2021-11-07 13:17:32,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:17:32,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:17:32,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:17:32,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:17:32,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:17:32,208 INFO L87 Difference]: Start difference. First operand 2640 states and 3927 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-07 13:17:34,279 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:17:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:17:34,758 INFO L93 Difference]: Finished difference Result 7970 states and 11863 transitions. [2021-11-07 13:17:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 13:17:34,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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 178 [2021-11-07 13:17:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:17:34,769 INFO L225 Difference]: With dead ends: 7970 [2021-11-07 13:17:34,770 INFO L226 Difference]: Without dead ends: 5434 [2021-11-07 13:17:34,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 158.79ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-07 13:17:34,773 INFO L933 BasicCegarLoop]: 1801 mSDtfsCounter, 2827 mSDsluCounter, 4662 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2120.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 6463 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.13ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2234.19ms IncrementalHoareTripleChecker+Time [2021-11-07 13:17:34,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2827 Valid, 6463 Invalid, 26 Unknown, 0 Unchecked, 4.13ms Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 1 Unknown, 0 Unchecked, 2234.19ms Time] [2021-11-07 13:17:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5434 states. [2021-11-07 13:17:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5434 to 2640. [2021-11-07 13:17:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.4880636604774535) internal successors, (3927), 2639 states have internal predecessors, (3927), 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-07 13:17:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3927 transitions. [2021-11-07 13:17:34,892 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3927 transitions. Word has length 178 [2021-11-07 13:17:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:17:34,893 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3927 transitions. [2021-11-07 13:17:34,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-07 13:17:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3927 transitions. [2021-11-07 13:17:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-11-07 13:17:34,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:17:34,896 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:17:34,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-07 13:17:35,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:35,112 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:17:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:17:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1246300446, now seen corresponding path program 1 times [2021-11-07 13:17:35,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:17:35,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97591070] [2021-11-07 13:17:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:35,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:17:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:17:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-07 13:17:35,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:17:35,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97591070] [2021-11-07 13:17:35,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97591070] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:17:35,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673773707] [2021-11-07 13:17:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:17:35,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:17:35,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:17:35,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:17:35,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-07 13:19:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:19:40,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 3602 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-07 13:19:40,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:19:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-07 13:19:41,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 13:19:41,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673773707] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:19:41,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-07 13:19:41,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-11-07 13:19:41,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9234864] [2021-11-07 13:19:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:19:41,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:19:41,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:19:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:19:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:19:41,023 INFO L87 Difference]: Start difference. First operand 2640 states and 3927 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-07 13:19:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:19:41,150 INFO L93 Difference]: Finished difference Result 5287 states and 7865 transitions. [2021-11-07 13:19:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:19:41,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 180 [2021-11-07 13:19:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:19:41,154 INFO L225 Difference]: With dead ends: 5287 [2021-11-07 13:19:41,154 INFO L226 Difference]: Without dead ends: 2751 [2021-11-07 13:19:41,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.28ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:19:41,159 INFO L933 BasicCegarLoop]: 1230 mSDtfsCounter, 1044 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.28ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.83ms IncrementalHoareTripleChecker+Time [2021-11-07 13:19:41,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1044 Valid, 1415 Invalid, 1 Unknown, 0 Unchecked, 1.28ms Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 3.83ms Time] [2021-11-07 13:19:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2021-11-07 13:19:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2640. [2021-11-07 13:19:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2640 states, 2639 states have (on average 1.486926866237211) internal successors, (3924), 2639 states have internal predecessors, (3924), 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-07 13:19:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 3924 transitions. [2021-11-07 13:19:41,281 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 3924 transitions. Word has length 180 [2021-11-07 13:19:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:19:41,281 INFO L470 AbstractCegarLoop]: Abstraction has 2640 states and 3924 transitions. [2021-11-07 13:19:41,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-07 13:19:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3924 transitions. [2021-11-07 13:19:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-07 13:19:41,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:19:41,285 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:19:41,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-07 13:19:41,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-07 13:19:41,495 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:19:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:19:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 70249393, now seen corresponding path program 1 times [2021-11-07 13:19:41,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:19:41,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709981668] [2021-11-07 13:19:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:19:41,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:19:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:19:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-07 13:19:41,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:19:41,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709981668] [2021-11-07 13:19:41,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709981668] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:19:41,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326111352] [2021-11-07 13:19:41,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:19:41,929 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:19:41,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:19:41,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:19:41,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-07 13:21:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:21:20,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 3625 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-07 13:21:20,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:21:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-07 13:21:21,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:21:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-07 13:21:21,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326111352] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 13:21:21,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 13:21:21,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-07 13:21:21,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771009218] [2021-11-07 13:21:21,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 13:21:21,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 13:21:21,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:21:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 13:21:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:21:21,900 INFO L87 Difference]: Start difference. First operand 2640 states and 3924 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-07 13:21:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:21:22,165 INFO L93 Difference]: Finished difference Result 5273 states and 7842 transitions. [2021-11-07 13:21:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 13:21:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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 181 [2021-11-07 13:21:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:21:22,170 INFO L225 Difference]: With dead ends: 5273 [2021-11-07 13:21:22,170 INFO L226 Difference]: Without dead ends: 2643 [2021-11-07 13:21:22,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 158.18ms TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:21:22,174 INFO L933 BasicCegarLoop]: 1071 mSDtfsCounter, 1061 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 33.38ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.69ms IncrementalHoareTripleChecker+Time [2021-11-07 13:21:22,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1061 Valid, 4286 Invalid, 15 Unknown, 0 Unchecked, 33.38ms Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 40.69ms Time] [2021-11-07 13:21:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2021-11-07 13:21:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2643. [2021-11-07 13:21:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2642 states have (on average 1.4863739591218774) internal successors, (3927), 2642 states have internal predecessors, (3927), 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-07 13:21:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3927 transitions. [2021-11-07 13:21:22,311 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3927 transitions. Word has length 181 [2021-11-07 13:21:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:21:22,311 INFO L470 AbstractCegarLoop]: Abstraction has 2643 states and 3927 transitions. [2021-11-07 13:21:22,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 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-07 13:21:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3927 transitions. [2021-11-07 13:21:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-07 13:21:22,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:21:22,315 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:21:22,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-07 13:21:22,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:21:22,523 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:21:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:21:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 547807168, now seen corresponding path program 2 times [2021-11-07 13:21:22,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:21:22,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672981897] [2021-11-07 13:21:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:21:22,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:21:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:21:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-07 13:21:26,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:21:26,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672981897] [2021-11-07 13:21:26,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672981897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:21:26,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:21:26,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 13:21:26,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477167988] [2021-11-07 13:21:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:21:26,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 13:21:26,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:21:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 13:21:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-07 13:21:26,111 INFO L87 Difference]: Start difference. First operand 2643 states and 3927 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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-07 13:21:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:21:27,581 INFO L93 Difference]: Finished difference Result 8644 states and 12873 transitions. [2021-11-07 13:21:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 13:21:27,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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 184 [2021-11-07 13:21:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:21:27,589 INFO L225 Difference]: With dead ends: 8644 [2021-11-07 13:21:27,589 INFO L226 Difference]: Without dead ends: 6108 [2021-11-07 13:21:27,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 590.22ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-07 13:21:27,592 INFO L933 BasicCegarLoop]: 2922 mSDtfsCounter, 8234 mSDsluCounter, 10750 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 666.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8234 SdHoareTripleChecker+Valid, 13672 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.45ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 707.64ms IncrementalHoareTripleChecker+Time [2021-11-07 13:21:27,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8234 Valid, 13672 Invalid, 228 Unknown, 0 Unchecked, 11.45ms Time], IncrementalHoareTripleChecker [19 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 707.64ms Time] [2021-11-07 13:21:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6108 states. [2021-11-07 13:21:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6108 to 2655. [2021-11-07 13:21:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.4826676714393368) internal successors, (3935), 2654 states have internal predecessors, (3935), 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-07 13:21:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3935 transitions. [2021-11-07 13:21:27,789 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3935 transitions. Word has length 184 [2021-11-07 13:21:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:21:27,789 INFO L470 AbstractCegarLoop]: Abstraction has 2655 states and 3935 transitions. [2021-11-07 13:21:27,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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-07 13:21:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3935 transitions. [2021-11-07 13:21:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-11-07 13:21:27,792 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:21:27,792 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:21:27,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 13:21:27,792 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:21:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:21:27,793 INFO L85 PathProgramCache]: Analyzing trace with hash 769204907, now seen corresponding path program 1 times [2021-11-07 13:21:27,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:21:27,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84358696] [2021-11-07 13:21:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:21:27,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:21:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:21:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-07 13:21:44,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:21:44,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84358696] [2021-11-07 13:21:44,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84358696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:21:44,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846726990] [2021-11-07 13:21:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:21:44,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:21:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:21:44,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:21:44,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-07 13:24:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:24:00,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 3762 conjuncts, 301 conjunts are in the unsatisfiable core [2021-11-07 13:24:00,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:24:02,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-07 13:24:03,858 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 13:24:03,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-07 13:24:04,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-11-07 13:24:05,079 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-11-07 13:24:05,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-11-07 13:24:05,753 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 13:24:05,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 45 [2021-11-07 13:24:06,034 INFO L354 Elim1Store]: treesize reduction 94, result has 29.9 percent of original size [2021-11-07 13:24:06,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 47 treesize of output 71 [2021-11-07 13:24:07,302 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 13:24:07,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 62 [2021-11-07 13:24:07,890 INFO L354 Elim1Store]: treesize reduction 68, result has 25.3 percent of original size [2021-11-07 13:24:07,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 70 [2021-11-07 13:24:09,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:24:09,845 INFO L354 Elim1Store]: treesize reduction 470, result has 10.3 percent of original size [2021-11-07 13:24:09,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 287 treesize of output 231 [2021-11-07 13:24:09,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:24:10,084 INFO L354 Elim1Store]: treesize reduction 844, result has 7.4 percent of original size [2021-11-07 13:24:10,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 154 [2021-11-07 13:24:11,198 INFO L354 Elim1Store]: treesize reduction 298, result has 17.2 percent of original size [2021-11-07 13:24:11,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 231 [2021-11-07 13:24:11,353 INFO L354 Elim1Store]: treesize reduction 400, result has 12.9 percent of original size [2021-11-07 13:24:11,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 303 treesize of output 164 [2021-11-07 13:24:22,266 INFO L354 Elim1Store]: treesize reduction 474, result has 17.4 percent of original size [2021-11-07 13:24:22,267 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 453 treesize of output 232 [2021-11-07 13:24:22,512 INFO L354 Elim1Store]: treesize reduction 236, result has 24.6 percent of original size [2021-11-07 13:24:22,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 402 treesize of output 316 [2021-11-07 13:24:26,189 INFO L354 Elim1Store]: treesize reduction 236, result has 13.2 percent of original size [2021-11-07 13:24:26,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 750 treesize of output 458 [2021-11-07 13:24:26,347 INFO L354 Elim1Store]: treesize reduction 344, result has 12.0 percent of original size [2021-11-07 13:24:26,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 503 treesize of output 271 [2021-11-07 13:24:29,747 INFO L354 Elim1Store]: treesize reduction 1076, result has 6.4 percent of original size [2021-11-07 13:24:29,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 34 case distinctions, treesize of input 952 treesize of output 412 [2021-11-07 13:24:30,989 INFO L354 Elim1Store]: treesize reduction 816, result has 8.0 percent of original size [2021-11-07 13:24:30,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 892 treesize of output 385 [2021-11-07 13:24:32,033 INFO L354 Elim1Store]: treesize reduction 768, result has 8.5 percent of original size [2021-11-07 13:24:32,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 850 treesize of output 361 [2021-11-07 13:24:32,920 INFO L354 Elim1Store]: treesize reduction 3540, result has 3.3 percent of original size [2021-11-07 13:24:32,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 756 treesize of output 526 [2021-11-07 13:24:33,988 INFO L354 Elim1Store]: treesize reduction 632, result has 9.7 percent of original size [2021-11-07 13:24:33,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1204 treesize of output 363 [2021-11-07 13:24:34,201 INFO L354 Elim1Store]: treesize reduction 584, result has 9.9 percent of original size [2021-11-07 13:24:34,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 1095 treesize of output 713 [2021-11-07 13:24:48,568 INFO L354 Elim1Store]: treesize reduction 561, result has 1.2 percent of original size [2021-11-07 13:24:48,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 36 case distinctions, treesize of input 1028 treesize of output 235 [2021-11-07 13:24:48,677 INFO L354 Elim1Store]: treesize reduction 269, result has 2.5 percent of original size [2021-11-07 13:24:48,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 205 treesize of output 157 [2021-11-07 13:24:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-07 13:24:49,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:27:06,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse20 (+ 36 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse18 (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse20 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ 12 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse11 (select .cse18 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse19 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse20 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset)))) (store .cse19 .cse11 (store (store (store (store (store (store (select .cse19 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base .cse18))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)) (.cse7 (+ 92 (select (select .cse8 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2))))))))) 18446744073709551616))) is different from false [2021-11-07 13:27:09,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* c_~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ 36 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse19 (store (select .cse18 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ 12 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.offset))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base (store (select .cse21 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9)) (.cse7 (+ (select (select .cse8 c_ULTIMATE.start___if_usb_submit_rx_urb_~cardp.base) .cse9) 92))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-07 13:27:14,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* c_~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ c_ULTIMATE.start_if_usb_resume_~cardp~10.offset 36))) (let ((.cse19 (store (select .cse18 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ c_ULTIMATE.start_if_usb_resume_~cardp~10.offset 12))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 c_ULTIMATE.start_if_usb_resume_~cardp~10.base (store (select .cse21 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 c_ULTIMATE.start_if_usb_resume_~cardp~10.base .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse9)) (.cse7 (+ 92 (select (select .cse8 c_ULTIMATE.start_if_usb_resume_~cardp~10.base) .cse9)))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-07 13:27:16,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* c_~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ |c_ULTIMATE.start_usb_get_intfdata_#res.offset| 36))) (let ((.cse19 (store (select .cse18 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ |c_ULTIMATE.start_usb_get_intfdata_#res.offset| 12))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 |c_ULTIMATE.start_usb_get_intfdata_#res.base| (store (select .cse21 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 |c_ULTIMATE.start_usb_get_intfdata_#res.base| .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse9)) (.cse7 (+ 92 (select (select .cse8 |c_ULTIMATE.start_usb_get_intfdata_#res.base|) .cse9)))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ 28 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-07 13:27:18,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse23 (+ (* c_~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.base))) (.cse22 (+ 36 |c_ULTIMATE.start_dev_get_drvdata_#res.offset|))) (let ((.cse19 (store (select .cse18 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse9 (+ 12 |c_ULTIMATE.start_dev_get_drvdata_#res.offset|))) (let ((.cse11 (select .cse19 .cse9)) (.cse12 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse13 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse15 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse16 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse23 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse21 |c_ULTIMATE.start_dev_get_drvdata_#res.base| (store (select .cse21 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse22 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse20 .cse11 (store (store (store (store (store (store (select .cse20 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse13 v_DerPreprocessor_8) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse15 v_DerPreprocessor_7) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse10 (store .cse18 |c_ULTIMATE.start_dev_get_drvdata_#res.base| .cse19))) (store .cse10 .cse11 (store (store (store (store (store (store (select .cse10 .cse11) .cse12 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse13 v_DerPreprocessor_6) .cse14 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse15 v_DerPreprocessor_5) .cse16 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse9)) (.cse7 (+ 92 (select (select .cse8 |c_ULTIMATE.start_dev_get_drvdata_#res.base|) .cse9)))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ 28 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))) 18446744073709551616))) is different from false [2021-11-07 13:27:21,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse25 (select (select |c_#memory_$Pointer$.offset| c_~if_usb_driver_group1~0.base) .cse4)) (.cse24 (+ (* c_~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#set_impl~0.base|) .cse24 ULTIMATE.start_ldv_set_add_~e.base))) (.cse9 (select (select |c_#memory_$Pointer$.base| c_~if_usb_driver_group1~0.base) .cse4)) (.cse23 (+ .cse25 36))) (let ((.cse20 (store (select .cse19 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse10 (+ .cse25 12))) (let ((.cse12 (select .cse20 .cse10)) (.cse13 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse15 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse16 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse18 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#set_impl~0.base|) .cse24 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse22 .cse9 (store (select .cse22 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse21 .cse12 (store (store (store (store (store (store (select .cse21 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse14 v_DerPreprocessor_8) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse16 v_DerPreprocessor_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse11 (store .cse19 .cse9 .cse20))) (store .cse11 .cse12 (store (store (store (store (store (store (select .cse11 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse14 v_DerPreprocessor_6) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse16 v_DerPreprocessor_5) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (+ 92 (select (select .cse8 .cse9) .cse10)))) (let ((.cse0 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4)))) (let ((.cse1 (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2))))))))))) 18446744073709551616))) is different from false [2021-11-07 13:27:32,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_set_add_~e.base Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7 Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 Int) (v_DerPreprocessor_6 Int) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7 Int) (ULTIMATE.start_ldv_set_add_~e.offset Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7 Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7 Int) (v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7 Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base Int) (ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset Int)) (< 0 (mod (let ((.cse28 (+ c_ULTIMATE.start_if_usb_probe_~intf.offset 533))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_if_usb_probe_~intf.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_if_usb_probe_~intf.base) .cse28 c_ULTIMATE.start_if_usb_probe_~cardp~3.offset))) (.cse4 (+ 533 c_~if_usb_driver_group1~0.offset))) (let ((.cse26 (select (select .cse24 c_~if_usb_driver_group1~0.base) .cse4)) (.cse27 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_if_usb_probe_~intf.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_if_usb_probe_~intf.base) .cse28 c_ULTIMATE.start_if_usb_probe_~cardp~3.base))) (.cse25 (+ (* c_~last_index~0 8) |~#set_impl~0.offset|))) (let ((.cse19 (store .cse27 |c_~#set_impl~0.base| (store (select .cse27 |c_~#set_impl~0.base|) .cse25 ULTIMATE.start_ldv_set_add_~e.base))) (.cse9 (select (select .cse27 c_~if_usb_driver_group1~0.base) .cse4)) (.cse23 (+ 36 .cse26))) (let ((.cse20 (store (select .cse19 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.base)) (.cse10 (+ 12 .cse26))) (let ((.cse12 (select .cse20 .cse10)) (.cse13 (+ 64 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse14 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 80)) (.cse15 (+ v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7 96)) (.cse16 (+ 128 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse17 (+ 176 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7)) (.cse18 (+ 168 v_ULTIMATE.start_usb_fill_bulk_urb_~urb.offset_7))) (let ((.cse8 (let ((.cse21 (let ((.cse22 (store .cse24 |c_~#set_impl~0.base| (store (select .cse24 |c_~#set_impl~0.base|) .cse25 ULTIMATE.start_ldv_set_add_~e.offset)))) (store .cse22 .cse9 (store (select .cse22 .cse9) .cse23 ULTIMATE.start___if_usb_submit_rx_urb_~skb~0.offset))))) (store .cse21 .cse12 (store (store (store (store (store (store (select .cse21 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.offset_7) .cse14 v_DerPreprocessor_8) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.offset_7) .cse16 v_DerPreprocessor_7) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.offset_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.offset_7)))) (.cse5 (let ((.cse11 (store .cse19 .cse9 .cse20))) (store .cse11 .cse12 (store (store (store (store (store (store (select .cse11 .cse12) .cse13 v_ULTIMATE.start_usb_fill_bulk_urb_~dev.base_7) .cse14 v_DerPreprocessor_6) .cse15 v_ULTIMATE.start_usb_fill_bulk_urb_~transfer_buffer.base_7) .cse16 v_DerPreprocessor_5) .cse17 v_ULTIMATE.start_usb_fill_bulk_urb_~complete_fn.base_7) .cse18 v_ULTIMATE.start_usb_fill_bulk_urb_~context.base_7))))) (let ((.cse6 (select (select .cse5 .cse9) .cse10)) (.cse7 (+ 92 (select (select .cse8 .cse9) .cse10)))) (let ((.cse3 (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_DerPreprocessor_3))) (.cse0 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_4)))) (let ((.cse1 (select (select .cse0 c_~if_usb_driver_group1~0.base) .cse4)) (.cse2 (+ (select (select .cse3 c_~if_usb_driver_group1~0.base) .cse4) 28))) (+ (select (select .cse0 .cse1) .cse2) (select (select .cse3 .cse1) .cse2)))))))))))) 18446744073709551616))) is different from false