./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:01:14,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:01:14,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:01:14,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:01:14,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:01:14,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:01:14,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:01:14,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:01:14,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:01:14,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:01:14,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:01:14,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:01:14,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:01:14,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:01:14,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:01:14,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:01:14,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:01:14,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:01:14,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:01:14,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:01:14,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:01:14,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:01:14,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:01:14,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:01:14,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:01:14,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:01:14,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:01:14,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:01:14,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:01:14,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:01:14,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:01:14,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:01:14,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:01:14,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:01:14,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:01:14,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:01:14,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:01:14,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:01:14,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:01:14,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:01:14,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:01:14,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 12:01:14,691 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:01:14,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:01:14,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:01:14,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:01:14,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:01:14,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:01:14,693 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:01:14,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:01:14,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 12:01:14,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:01:14,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:01:14,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:01:14,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:01:14,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:01:14,695 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:01:14,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:01:14,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:01:14,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:01:14,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:01:14,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:01:14,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:01:14,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:01:14,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:01:14,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 12:01:14,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 12:01:14,696 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:01:14,696 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:01:14,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:01:14,697 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:01:14,697 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-11-06 12:01:14,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:01:14,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:01:14,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:01:14,928 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:01:14,929 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:01:14,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-06 12:01:14,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681db5caa/8091c55859bb4d8db170e5f7f6d1206f/FLAGb6e232ab8 [2021-11-06 12:01:15,593 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:01:15,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-06 12:01:15,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681db5caa/8091c55859bb4d8db170e5f7f6d1206f/FLAGb6e232ab8 [2021-11-06 12:01:16,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681db5caa/8091c55859bb4d8db170e5f7f6d1206f [2021-11-06 12:01:16,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:01:16,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:01:16,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:01:16,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:01:16,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:01:16,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:01:16" (1/1) ... [2021-11-06 12:01:16,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1f07a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:16, skipping insertion in model container [2021-11-06 12:01:16,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:01:16" (1/1) ... [2021-11-06 12:01:16,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:01:16,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:01:16,883 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-06 12:01:16,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:01:16,934 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:01:17,113 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-06 12:01:17,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:01:17,240 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:01:17,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17 WrapperNode [2021-11-06 12:01:17,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:01:17,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:01:17,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:01:17,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:01:17,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:01:17,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:01:17,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:01:17,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:01:17,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:01:17,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:01:17,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:01:17,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:01:17,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (1/1) ... [2021-11-06 12:01:17,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:01:17,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:01:17,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 12:01:17,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 12:01:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 12:01:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:01:17,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:01:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:01:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 12:01:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 12:01:17,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:01:17,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:01:17,898 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:20,698 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-11-06 12:01:20,699 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-11-06 12:01:20,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:01:20,706 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-11-06 12:01:20,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:01:20 BoogieIcfgContainer [2021-11-06 12:01:20,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:01:20,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:01:20,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:01:20,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:01:20,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:01:16" (1/3) ... [2021-11-06 12:01:20,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e936405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:01:20, skipping insertion in model container [2021-11-06 12:01:20,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:17" (2/3) ... [2021-11-06 12:01:20,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e936405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:01:20, skipping insertion in model container [2021-11-06 12:01:20,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:01:20" (3/3) ... [2021-11-06 12:01:20,714 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-06 12:01:20,717 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:01:20,717 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 12:01:20,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:01:20,749 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 12:01:20,750 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 12:01:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 12:01:20,765 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:20,766 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:20,766 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-11-06 12:01:20,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:20,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848294772] [2021-11-06 12:01:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:20,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:21,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:21,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848294772] [2021-11-06 12:01:21,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848294772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:21,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:21,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:01:21,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811953857] [2021-11-06 12:01:21,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:21,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:21,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:21,066 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:21,188 INFO L93 Difference]: Finished difference Result 1189 states and 1749 transitions. [2021-11-06 12:01:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2021-11-06 12:01:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:21,204 INFO L225 Difference]: With dead ends: 1189 [2021-11-06 12:01:21,204 INFO L226 Difference]: Without dead ends: 765 [2021-11-06 12:01:21,208 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:21,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-06 12:01:21,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2021-11-06 12:01:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 736 states have (on average 1.327445652173913) internal successors, (977), 746 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 977 transitions. [2021-11-06 12:01:21,263 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 977 transitions. Word has length 10 [2021-11-06 12:01:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:21,264 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 977 transitions. [2021-11-06 12:01:21,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 977 transitions. [2021-11-06 12:01:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-06 12:01:21,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:21,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:21,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 12:01:21,265 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-11-06 12:01:21,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:21,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570730097] [2021-11-06 12:01:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:21,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:21,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:21,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570730097] [2021-11-06 12:01:21,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570730097] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:21,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:21,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:01:21,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662961248] [2021-11-06 12:01:21,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:21,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:21,333 INFO L87 Difference]: Start difference. First operand 747 states and 977 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:21,372 INFO L93 Difference]: Finished difference Result 2217 states and 2904 transitions. [2021-11-06 12:01:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:21,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-06 12:01:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:21,377 INFO L225 Difference]: With dead ends: 2217 [2021-11-06 12:01:21,377 INFO L226 Difference]: Without dead ends: 1475 [2021-11-06 12:01:21,380 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-11-06 12:01:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1446. [2021-11-06 12:01:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1435 states have (on average 1.3261324041811846) internal successors, (1903), 1445 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1903 transitions. [2021-11-06 12:01:21,458 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1903 transitions. Word has length 11 [2021-11-06 12:01:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:21,459 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1903 transitions. [2021-11-06 12:01:21,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1903 transitions. [2021-11-06 12:01:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 12:01:21,461 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:21,461 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:21,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 12:01:21,461 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-11-06 12:01:21,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:21,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116426448] [2021-11-06 12:01:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:21,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:21,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:21,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:21,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116426448] [2021-11-06 12:01:21,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116426448] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:21,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:21,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:21,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153870303] [2021-11-06 12:01:21,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:21,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:21,573 INFO L87 Difference]: Start difference. First operand 1446 states and 1903 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:21,666 INFO L93 Difference]: Finished difference Result 3924 states and 5208 transitions. [2021-11-06 12:01:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2021-11-06 12:01:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:21,674 INFO L225 Difference]: With dead ends: 3924 [2021-11-06 12:01:21,674 INFO L226 Difference]: Without dead ends: 2485 [2021-11-06 12:01:21,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2021-11-06 12:01:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2453. [2021-11-06 12:01:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2442 states have (on average 1.341932841932842) internal successors, (3277), 2452 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3277 transitions. [2021-11-06 12:01:21,731 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3277 transitions. Word has length 38 [2021-11-06 12:01:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:21,732 INFO L470 AbstractCegarLoop]: Abstraction has 2453 states and 3277 transitions. [2021-11-06 12:01:21,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3277 transitions. [2021-11-06 12:01:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 12:01:21,737 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:21,737 INFO L513 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] [2021-11-06 12:01:21,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 12:01:21,738 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1309389857, now seen corresponding path program 1 times [2021-11-06 12:01:21,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:21,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621047547] [2021-11-06 12:01:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:21,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:21,884 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-06 12:01:21,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:21,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621047547] [2021-11-06 12:01:21,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621047547] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:21,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:21,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:21,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650068498] [2021-11-06 12:01:21,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:21,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:21,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:21,889 INFO L87 Difference]: Start difference. First operand 2453 states and 3277 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:21,999 INFO L93 Difference]: Finished difference Result 7327 states and 9781 transitions. [2021-11-06 12:01:22,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:22,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2021-11-06 12:01:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:22,016 INFO L225 Difference]: With dead ends: 7327 [2021-11-06 12:01:22,016 INFO L226 Difference]: Without dead ends: 4882 [2021-11-06 12:01:22,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2021-11-06 12:01:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 2469. [2021-11-06 12:01:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2458 states have (on average 1.339707078925956) internal successors, (3293), 2468 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3293 transitions. [2021-11-06 12:01:22,139 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3293 transitions. Word has length 41 [2021-11-06 12:01:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:22,139 INFO L470 AbstractCegarLoop]: Abstraction has 2469 states and 3293 transitions. [2021-11-06 12:01:22,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3293 transitions. [2021-11-06 12:01:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:01:22,142 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:22,143 INFO L513 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] [2021-11-06 12:01:22,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 12:01:22,143 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:22,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1996940455, now seen corresponding path program 1 times [2021-11-06 12:01:22,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:22,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965304065] [2021-11-06 12:01:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:22,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:22,242 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-06 12:01:22,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:22,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965304065] [2021-11-06 12:01:22,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965304065] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:22,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:22,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:22,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915838159] [2021-11-06 12:01:22,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:22,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:22,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:22,246 INFO L87 Difference]: Start difference. First operand 2469 states and 3293 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:22,360 INFO L93 Difference]: Finished difference Result 6707 states and 8941 transitions. [2021-11-06 12:01:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2021-11-06 12:01:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:22,373 INFO L225 Difference]: With dead ends: 6707 [2021-11-06 12:01:22,374 INFO L226 Difference]: Without dead ends: 4246 [2021-11-06 12:01:22,378 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2021-11-06 12:01:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 2485. [2021-11-06 12:01:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2485 states, 2474 states have (on average 1.3375101050929668) internal successors, (3309), 2484 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2485 states and 3309 transitions. [2021-11-06 12:01:22,484 INFO L78 Accepts]: Start accepts. Automaton has 2485 states and 3309 transitions. Word has length 42 [2021-11-06 12:01:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:22,484 INFO L470 AbstractCegarLoop]: Abstraction has 2485 states and 3309 transitions. [2021-11-06 12:01:22,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3309 transitions. [2021-11-06 12:01:22,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:01:22,486 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:22,486 INFO L513 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] [2021-11-06 12:01:22,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 12:01:22,486 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash -942849768, now seen corresponding path program 1 times [2021-11-06 12:01:22,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:22,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379589923] [2021-11-06 12:01:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:22,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:22,582 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-06 12:01:22,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:22,584 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379589923] [2021-11-06 12:01:22,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379589923] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:22,584 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:22,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:22,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002789996] [2021-11-06 12:01:22,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:22,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:22,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:22,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:22,589 INFO L87 Difference]: Start difference. First operand 2485 states and 3309 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:23,166 INFO L93 Difference]: Finished difference Result 13586 states and 18045 transitions. [2021-11-06 12:01:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:01:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2021-11-06 12:01:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:23,206 INFO L225 Difference]: With dead ends: 13586 [2021-11-06 12:01:23,206 INFO L226 Difference]: Without dead ends: 12316 [2021-11-06 12:01:23,213 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:01:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12316 states. [2021-11-06 12:01:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12316 to 2545. [2021-11-06 12:01:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2534 states have (on average 1.329518547750592) internal successors, (3369), 2544 states have internal predecessors, (3369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3369 transitions. [2021-11-06 12:01:23,408 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3369 transitions. Word has length 42 [2021-11-06 12:01:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:23,410 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 3369 transitions. [2021-11-06 12:01:23,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:23,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3369 transitions. [2021-11-06 12:01:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:01:23,411 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:23,411 INFO L513 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] [2021-11-06 12:01:23,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 12:01:23,411 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1763769626, now seen corresponding path program 1 times [2021-11-06 12:01:23,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:23,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602750082] [2021-11-06 12:01:23,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:23,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:23,525 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-06 12:01:23,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:23,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602750082] [2021-11-06 12:01:23,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602750082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:23,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:23,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:01:23,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37993263] [2021-11-06 12:01:23,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:01:23,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:23,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:01:23,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:23,528 INFO L87 Difference]: Start difference. First operand 2545 states and 3369 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:24,870 INFO L93 Difference]: Finished difference Result 19757 states and 26263 transitions. [2021-11-06 12:01:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 12:01:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 42 [2021-11-06 12:01:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:24,902 INFO L225 Difference]: With dead ends: 19757 [2021-11-06 12:01:24,902 INFO L226 Difference]: Without dead ends: 17220 [2021-11-06 12:01:24,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-06 12:01:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2021-11-06 12:01:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 2523. [2021-11-06 12:01:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2512 states have (on average 1.3244426751592357) internal successors, (3327), 2522 states have internal predecessors, (3327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3327 transitions. [2021-11-06 12:01:25,142 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3327 transitions. Word has length 42 [2021-11-06 12:01:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:25,143 INFO L470 AbstractCegarLoop]: Abstraction has 2523 states and 3327 transitions. [2021-11-06 12:01:25,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3327 transitions. [2021-11-06 12:01:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 12:01:25,144 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:25,144 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:25,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 12:01:25,145 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1882537444, now seen corresponding path program 1 times [2021-11-06 12:01:25,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:25,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127078844] [2021-11-06 12:01:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:25,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:25,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:25,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127078844] [2021-11-06 12:01:25,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127078844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:25,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:25,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:25,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659892862] [2021-11-06 12:01:25,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:25,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:25,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:25,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:25,211 INFO L87 Difference]: Start difference. First operand 2523 states and 3327 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:25,593 INFO L93 Difference]: Finished difference Result 8648 states and 11424 transitions. [2021-11-06 12:01:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:01:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2021-11-06 12:01:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:25,602 INFO L225 Difference]: With dead ends: 8648 [2021-11-06 12:01:25,603 INFO L226 Difference]: Without dead ends: 6133 [2021-11-06 12:01:25,605 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2021-11-06 12:01:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2261. [2021-11-06 12:01:25,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2250 states have (on average 1.3177777777777777) internal successors, (2965), 2260 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2965 transitions. [2021-11-06 12:01:25,735 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2965 transitions. Word has length 44 [2021-11-06 12:01:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:25,735 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 2965 transitions. [2021-11-06 12:01:25,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2965 transitions. [2021-11-06 12:01:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 12:01:25,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:25,736 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:25,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 12:01:25,737 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -297582244, now seen corresponding path program 1 times [2021-11-06 12:01:25,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:25,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748858873] [2021-11-06 12:01:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:25,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:25,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:25,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748858873] [2021-11-06 12:01:25,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748858873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:25,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:25,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:25,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668347784] [2021-11-06 12:01:25,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:25,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:25,801 INFO L87 Difference]: Start difference. First operand 2261 states and 2965 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:26,142 INFO L93 Difference]: Finished difference Result 3590 states and 4695 transitions. [2021-11-06 12:01:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-11-06 12:01:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:26,148 INFO L225 Difference]: With dead ends: 3590 [2021-11-06 12:01:26,148 INFO L226 Difference]: Without dead ends: 3575 [2021-11-06 12:01:26,149 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3575 states. [2021-11-06 12:01:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3575 to 3517. [2021-11-06 12:01:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3517 states, 3506 states have (on average 1.3168853394181403) internal successors, (4617), 3516 states have internal predecessors, (4617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:26,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3517 states to 3517 states and 4617 transitions. [2021-11-06 12:01:26,328 INFO L78 Accepts]: Start accepts. Automaton has 3517 states and 4617 transitions. Word has length 44 [2021-11-06 12:01:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:26,328 INFO L470 AbstractCegarLoop]: Abstraction has 3517 states and 4617 transitions. [2021-11-06 12:01:26,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3517 states and 4617 transitions. [2021-11-06 12:01:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 12:01:26,329 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:26,330 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:26,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 12:01:26,330 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1289306960, now seen corresponding path program 1 times [2021-11-06 12:01:26,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:26,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008460767] [2021-11-06 12:01:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:26,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:26,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:26,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008460767] [2021-11-06 12:01:26,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008460767] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:26,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:26,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:01:26,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630009332] [2021-11-06 12:01:26,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:01:26,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:01:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:26,411 INFO L87 Difference]: Start difference. First operand 3517 states and 4617 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:27,461 INFO L93 Difference]: Finished difference Result 11542 states and 15215 transitions. [2021-11-06 12:01:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-06 12:01:27,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 12:01:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:27,475 INFO L225 Difference]: With dead ends: 11542 [2021-11-06 12:01:27,476 INFO L226 Difference]: Without dead ends: 8978 [2021-11-06 12:01:27,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-11-06 12:01:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8978 states. [2021-11-06 12:01:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8978 to 3533. [2021-11-06 12:01:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3533 states, 3522 states have (on average 1.3154457694491766) internal successors, (4633), 3532 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3533 states and 4633 transitions. [2021-11-06 12:01:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3533 states and 4633 transitions. Word has length 47 [2021-11-06 12:01:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:27,745 INFO L470 AbstractCegarLoop]: Abstraction has 3533 states and 4633 transitions. [2021-11-06 12:01:27,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 4633 transitions. [2021-11-06 12:01:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 12:01:27,746 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:27,746 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:27,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 12:01:27,746 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:27,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 523835089, now seen corresponding path program 1 times [2021-11-06 12:01:27,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:27,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930973969] [2021-11-06 12:01:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:27,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:27,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:27,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930973969] [2021-11-06 12:01:27,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930973969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:27,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:27,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:27,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663453790] [2021-11-06 12:01:27,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:27,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:27,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:27,816 INFO L87 Difference]: Start difference. First operand 3533 states and 4633 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:28,399 INFO L93 Difference]: Finished difference Result 11349 states and 14904 transitions. [2021-11-06 12:01:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:01:28,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2021-11-06 12:01:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:28,408 INFO L225 Difference]: With dead ends: 11349 [2021-11-06 12:01:28,409 INFO L226 Difference]: Without dead ends: 7824 [2021-11-06 12:01:28,413 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2021-11-06 12:01:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 2999. [2021-11-06 12:01:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2988 states have (on average 1.3119143239625168) internal successors, (3920), 2998 states have internal predecessors, (3920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3920 transitions. [2021-11-06 12:01:28,647 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3920 transitions. Word has length 51 [2021-11-06 12:01:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:28,647 INFO L470 AbstractCegarLoop]: Abstraction has 2999 states and 3920 transitions. [2021-11-06 12:01:28,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3920 transitions. [2021-11-06 12:01:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:01:28,649 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:28,649 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:28,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 12:01:28,649 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 291347065, now seen corresponding path program 1 times [2021-11-06 12:01:28,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:28,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590311296] [2021-11-06 12:01:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:28,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:28,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:28,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590311296] [2021-11-06 12:01:28,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590311296] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:28,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:28,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:28,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043900454] [2021-11-06 12:01:28,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:28,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:28,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:28,719 INFO L87 Difference]: Start difference. First operand 2999 states and 3920 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:29,321 INFO L93 Difference]: Finished difference Result 9993 states and 13045 transitions. [2021-11-06 12:01:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:01:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2021-11-06 12:01:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:29,330 INFO L225 Difference]: With dead ends: 9993 [2021-11-06 12:01:29,330 INFO L226 Difference]: Without dead ends: 7413 [2021-11-06 12:01:29,334 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2021-11-06 12:01:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 2791. [2021-11-06 12:01:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2780 states have (on average 1.3071942446043165) internal successors, (3634), 2790 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3634 transitions. [2021-11-06 12:01:29,551 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3634 transitions. Word has length 52 [2021-11-06 12:01:29,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:29,551 INFO L470 AbstractCegarLoop]: Abstraction has 2791 states and 3634 transitions. [2021-11-06 12:01:29,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:29,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3634 transitions. [2021-11-06 12:01:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:01:29,553 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:29,553 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:29,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 12:01:29,553 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:29,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:29,554 INFO L85 PathProgramCache]: Analyzing trace with hash -729721289, now seen corresponding path program 1 times [2021-11-06 12:01:29,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:29,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695626118] [2021-11-06 12:01:29,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:29,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:29,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:29,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695626118] [2021-11-06 12:01:29,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695626118] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:29,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:29,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:29,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962207958] [2021-11-06 12:01:29,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:29,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:29,630 INFO L87 Difference]: Start difference. First operand 2791 states and 3634 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:31,236 INFO L93 Difference]: Finished difference Result 16519 states and 21743 transitions. [2021-11-06 12:01:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:01:31,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2021-11-06 12:01:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:31,256 INFO L225 Difference]: With dead ends: 16519 [2021-11-06 12:01:31,256 INFO L226 Difference]: Without dead ends: 15196 [2021-11-06 12:01:31,261 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:01:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15196 states. [2021-11-06 12:01:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15196 to 2839. [2021-11-06 12:01:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2828 states have (on average 1.301980198019802) internal successors, (3682), 2838 states have internal predecessors, (3682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3682 transitions. [2021-11-06 12:01:31,553 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3682 transitions. Word has length 52 [2021-11-06 12:01:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:31,553 INFO L470 AbstractCegarLoop]: Abstraction has 2839 states and 3682 transitions. [2021-11-06 12:01:31,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3682 transitions. [2021-11-06 12:01:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:01:31,554 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:31,554 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:31,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 12:01:31,555 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:31,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1876302265, now seen corresponding path program 1 times [2021-11-06 12:01:31,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:31,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523529638] [2021-11-06 12:01:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:31,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:31,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:31,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523529638] [2021-11-06 12:01:31,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523529638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:31,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:31,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:31,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150476863] [2021-11-06 12:01:31,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:31,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:31,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:31,635 INFO L87 Difference]: Start difference. First operand 2839 states and 3682 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:31,977 INFO L93 Difference]: Finished difference Result 5333 states and 6923 transitions. [2021-11-06 12:01:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:31,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2021-11-06 12:01:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:31,983 INFO L225 Difference]: With dead ends: 5333 [2021-11-06 12:01:31,983 INFO L226 Difference]: Without dead ends: 3986 [2021-11-06 12:01:31,985 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2021-11-06 12:01:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 2847. [2021-11-06 12:01:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2836 states have (on average 1.3011283497884345) internal successors, (3690), 2846 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3690 transitions. [2021-11-06 12:01:32,223 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3690 transitions. Word has length 52 [2021-11-06 12:01:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:32,223 INFO L470 AbstractCegarLoop]: Abstraction has 2847 states and 3690 transitions. [2021-11-06 12:01:32,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3690 transitions. [2021-11-06 12:01:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 12:01:32,225 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:32,225 INFO L513 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] [2021-11-06 12:01:32,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 12:01:32,225 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash -873150611, now seen corresponding path program 1 times [2021-11-06 12:01:32,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:32,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539723735] [2021-11-06 12:01:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:32,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:32,339 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-06 12:01:32,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:32,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539723735] [2021-11-06 12:01:32,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539723735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:32,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:32,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 12:01:32,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23132259] [2021-11-06 12:01:32,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 12:01:32,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 12:01:32,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:01:32,341 INFO L87 Difference]: Start difference. First operand 2847 states and 3690 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:34,590 INFO L93 Difference]: Finished difference Result 14958 states and 19505 transitions. [2021-11-06 12:01:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-06 12:01:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 53 [2021-11-06 12:01:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:34,605 INFO L225 Difference]: With dead ends: 14958 [2021-11-06 12:01:34,606 INFO L226 Difference]: Without dead ends: 12530 [2021-11-06 12:01:34,611 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-11-06 12:01:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12530 states. [2021-11-06 12:01:34,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12530 to 2845. [2021-11-06 12:01:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2834 states have (on average 1.297106563161609) internal successors, (3676), 2844 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3676 transitions. [2021-11-06 12:01:34,991 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3676 transitions. Word has length 53 [2021-11-06 12:01:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:34,992 INFO L470 AbstractCegarLoop]: Abstraction has 2845 states and 3676 transitions. [2021-11-06 12:01:34,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3676 transitions. [2021-11-06 12:01:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 12:01:34,993 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:34,994 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 12:01:34,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 12:01:34,994 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:34,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash 24644017, now seen corresponding path program 1 times [2021-11-06 12:01:34,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:34,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216490564] [2021-11-06 12:01:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:34,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:35,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:35,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216490564] [2021-11-06 12:01:35,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216490564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:35,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:35,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:35,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629520113] [2021-11-06 12:01:35,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:35,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:35,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:35,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:35,045 INFO L87 Difference]: Start difference. First operand 2845 states and 3676 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:35,525 INFO L93 Difference]: Finished difference Result 5701 states and 7365 transitions. [2021-11-06 12:01:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:35,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-06 12:01:35,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:35,529 INFO L225 Difference]: With dead ends: 5701 [2021-11-06 12:01:35,529 INFO L226 Difference]: Without dead ends: 2862 [2021-11-06 12:01:35,533 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2021-11-06 12:01:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2849. [2021-11-06 12:01:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2838 states have (on average 1.2963354474982383) internal successors, (3679), 2848 states have internal predecessors, (3679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3679 transitions. [2021-11-06 12:01:35,816 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3679 transitions. Word has length 53 [2021-11-06 12:01:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:35,816 INFO L470 AbstractCegarLoop]: Abstraction has 2849 states and 3679 transitions. [2021-11-06 12:01:35,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3679 transitions. [2021-11-06 12:01:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 12:01:35,818 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:35,818 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:35,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 12:01:35,819 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:35,819 INFO L85 PathProgramCache]: Analyzing trace with hash 446058872, now seen corresponding path program 1 times [2021-11-06 12:01:35,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:35,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805566375] [2021-11-06 12:01:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:35,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:35,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:35,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805566375] [2021-11-06 12:01:35,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805566375] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:35,881 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:35,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:35,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725842605] [2021-11-06 12:01:35,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:35,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:35,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:35,883 INFO L87 Difference]: Start difference. First operand 2849 states and 3679 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:36,541 INFO L93 Difference]: Finished difference Result 4213 states and 5426 transitions. [2021-11-06 12:01:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:36,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-11-06 12:01:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:36,546 INFO L225 Difference]: With dead ends: 4213 [2021-11-06 12:01:36,547 INFO L226 Difference]: Without dead ends: 4207 [2021-11-06 12:01:36,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2021-11-06 12:01:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 4161. [2021-11-06 12:01:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 4150 states have (on average 1.296144578313253) internal successors, (5379), 4160 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5379 transitions. [2021-11-06 12:01:36,980 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5379 transitions. Word has length 54 [2021-11-06 12:01:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:36,980 INFO L470 AbstractCegarLoop]: Abstraction has 4161 states and 5379 transitions. [2021-11-06 12:01:36,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5379 transitions. [2021-11-06 12:01:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 12:01:36,985 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:36,985 INFO L513 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] [2021-11-06 12:01:36,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 12:01:36,986 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1584391570, now seen corresponding path program 1 times [2021-11-06 12:01:36,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:36,986 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554923460] [2021-11-06 12:01:36,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:36,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 12:01:37,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:37,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554923460] [2021-11-06 12:01:37,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554923460] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:37,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:37,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:37,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480557860] [2021-11-06 12:01:37,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:37,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:37,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:37,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:37,167 INFO L87 Difference]: Start difference. First operand 4161 states and 5379 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:37,602 INFO L93 Difference]: Finished difference Result 8316 states and 10751 transitions. [2021-11-06 12:01:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 55 [2021-11-06 12:01:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:37,607 INFO L225 Difference]: With dead ends: 8316 [2021-11-06 12:01:37,607 INFO L226 Difference]: Without dead ends: 4161 [2021-11-06 12:01:37,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2021-11-06 12:01:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 4161. [2021-11-06 12:01:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 4150 states have (on average 1.2959036144578313) internal successors, (5378), 4160 states have internal predecessors, (5378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5378 transitions. [2021-11-06 12:01:38,008 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5378 transitions. Word has length 55 [2021-11-06 12:01:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:38,008 INFO L470 AbstractCegarLoop]: Abstraction has 4161 states and 5378 transitions. [2021-11-06 12:01:38,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5378 transitions. [2021-11-06 12:01:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 12:01:38,009 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:38,009 INFO L513 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] [2021-11-06 12:01:38,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 12:01:38,010 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:38,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1103311312, now seen corresponding path program 1 times [2021-11-06 12:01:38,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:38,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408296466] [2021-11-06 12:01:38,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:38,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-06 12:01:38,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:38,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408296466] [2021-11-06 12:01:38,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408296466] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:38,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:38,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:38,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080337996] [2021-11-06 12:01:38,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:38,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:38,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:38,144 INFO L87 Difference]: Start difference. First operand 4161 states and 5378 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:39,273 INFO L93 Difference]: Finished difference Result 10859 states and 14066 transitions. [2021-11-06 12:01:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 55 [2021-11-06 12:01:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:39,285 INFO L225 Difference]: With dead ends: 10859 [2021-11-06 12:01:39,285 INFO L226 Difference]: Without dead ends: 8950 [2021-11-06 12:01:39,290 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8950 states. [2021-11-06 12:01:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8950 to 8709. [2021-11-06 12:01:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8709 states, 8698 states have (on average 1.2994941365831225) internal successors, (11303), 8708 states have internal predecessors, (11303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 11303 transitions. [2021-11-06 12:01:40,336 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 11303 transitions. Word has length 55 [2021-11-06 12:01:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:40,336 INFO L470 AbstractCegarLoop]: Abstraction has 8709 states and 11303 transitions. [2021-11-06 12:01:40,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 11303 transitions. [2021-11-06 12:01:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 12:01:40,337 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:40,337 INFO L513 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] [2021-11-06 12:01:40,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 12:01:40,338 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1514792705, now seen corresponding path program 1 times [2021-11-06 12:01:40,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:40,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965494915] [2021-11-06 12:01:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:40,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:40,412 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-06 12:01:40,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:40,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965494915] [2021-11-06 12:01:40,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965494915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:40,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:40,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:01:40,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557255593] [2021-11-06 12:01:40,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:01:40,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:40,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:01:40,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:40,415 INFO L87 Difference]: Start difference. First operand 8709 states and 11303 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:43,337 INFO L93 Difference]: Finished difference Result 25969 states and 33869 transitions. [2021-11-06 12:01:43,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-06 12:01:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 56 [2021-11-06 12:01:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:43,370 INFO L225 Difference]: With dead ends: 25969 [2021-11-06 12:01:43,370 INFO L226 Difference]: Without dead ends: 22427 [2021-11-06 12:01:43,381 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2021-11-06 12:01:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22427 states. [2021-11-06 12:01:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22427 to 8709. [2021-11-06 12:01:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8709 states, 8698 states have (on average 1.2978845711657852) internal successors, (11289), 8708 states have internal predecessors, (11289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8709 states to 8709 states and 11289 transitions. [2021-11-06 12:01:44,545 INFO L78 Accepts]: Start accepts. Automaton has 8709 states and 11289 transitions. Word has length 56 [2021-11-06 12:01:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:44,545 INFO L470 AbstractCegarLoop]: Abstraction has 8709 states and 11289 transitions. [2021-11-06 12:01:44,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 8709 states and 11289 transitions. [2021-11-06 12:01:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 12:01:44,546 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:44,546 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:44,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 12:01:44,547 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash 850396480, now seen corresponding path program 1 times [2021-11-06 12:01:44,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:44,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364296146] [2021-11-06 12:01:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:44,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:44,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:44,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364296146] [2021-11-06 12:01:44,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364296146] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:44,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:44,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:44,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379317764] [2021-11-06 12:01:44,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:44,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:44,624 INFO L87 Difference]: Start difference. First operand 8709 states and 11289 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:48,458 INFO L93 Difference]: Finished difference Result 23747 states and 30994 transitions. [2021-11-06 12:01:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:01:48,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2021-11-06 12:01:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:48,485 INFO L225 Difference]: With dead ends: 23747 [2021-11-06 12:01:48,486 INFO L226 Difference]: Without dead ends: 15040 [2021-11-06 12:01:48,499 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15040 states. [2021-11-06 12:01:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15040 to 8718. [2021-11-06 12:01:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8718 states, 8707 states have (on average 1.2973469622143103) internal successors, (11296), 8717 states have internal predecessors, (11296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 11296 transitions. [2021-11-06 12:01:49,651 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 11296 transitions. Word has length 58 [2021-11-06 12:01:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:49,651 INFO L470 AbstractCegarLoop]: Abstraction has 8718 states and 11296 transitions. [2021-11-06 12:01:49,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 11296 transitions. [2021-11-06 12:01:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 12:01:49,653 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:49,653 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:49,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 12:01:49,654 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:49,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1274043202, now seen corresponding path program 1 times [2021-11-06 12:01:49,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:49,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406372627] [2021-11-06 12:01:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:49,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:49,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:49,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406372627] [2021-11-06 12:01:49,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406372627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:49,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:49,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:49,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891097602] [2021-11-06 12:01:49,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:49,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:49,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:49,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:49,713 INFO L87 Difference]: Start difference. First operand 8718 states and 11296 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:50,751 INFO L93 Difference]: Finished difference Result 17476 states and 22648 transitions. [2021-11-06 12:01:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-11-06 12:01:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:50,764 INFO L225 Difference]: With dead ends: 17476 [2021-11-06 12:01:50,764 INFO L226 Difference]: Without dead ends: 8766 [2021-11-06 12:01:50,777 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8766 states. [2021-11-06 12:01:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8766 to 8750. [2021-11-06 12:01:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8750 states, 8739 states have (on average 1.2962581531067627) internal successors, (11328), 8749 states have internal predecessors, (11328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 11328 transitions. [2021-11-06 12:01:51,754 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 11328 transitions. Word has length 58 [2021-11-06 12:01:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:51,754 INFO L470 AbstractCegarLoop]: Abstraction has 8750 states and 11328 transitions. [2021-11-06 12:01:51,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 11328 transitions. [2021-11-06 12:01:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 12:01:51,755 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:51,755 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:51,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 12:01:51,755 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1482038547, now seen corresponding path program 1 times [2021-11-06 12:01:51,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:51,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717341410] [2021-11-06 12:01:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:51,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:51,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:51,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717341410] [2021-11-06 12:01:51,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717341410] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:51,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:51,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:51,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55345195] [2021-11-06 12:01:51,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:51,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:51,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:51,843 INFO L87 Difference]: Start difference. First operand 8750 states and 11328 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:54,758 INFO L93 Difference]: Finished difference Result 33275 states and 42756 transitions. [2021-11-06 12:01:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:01:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2021-11-06 12:01:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:54,788 INFO L225 Difference]: With dead ends: 33275 [2021-11-06 12:01:54,789 INFO L226 Difference]: Without dead ends: 24533 [2021-11-06 12:01:54,804 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:54,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24533 states. [2021-11-06 12:01:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24533 to 8814. [2021-11-06 12:01:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8814 states, 8803 states have (on average 1.2941042826309213) internal successors, (11392), 8813 states have internal predecessors, (11392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8814 states to 8814 states and 11392 transitions. [2021-11-06 12:01:55,987 INFO L78 Accepts]: Start accepts. Automaton has 8814 states and 11392 transitions. Word has length 59 [2021-11-06 12:01:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:55,987 INFO L470 AbstractCegarLoop]: Abstraction has 8814 states and 11392 transitions. [2021-11-06 12:01:55,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8814 states and 11392 transitions. [2021-11-06 12:01:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 12:01:55,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:55,989 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:55,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 12:01:55,990 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:01:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1678973000, now seen corresponding path program 1 times [2021-11-06 12:01:55,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:55,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251932627] [2021-11-06 12:01:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:55,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:56,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:56,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251932627] [2021-11-06 12:01:56,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251932627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:56,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:56,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:56,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236859012] [2021-11-06 12:01:56,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:56,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:56,072 INFO L87 Difference]: Start difference. First operand 8814 states and 11392 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:01:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:59,493 INFO L93 Difference]: Finished difference Result 31078 states and 40126 transitions. [2021-11-06 12:01:59,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:01:59,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2021-11-06 12:01:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:59,529 INFO L225 Difference]: With dead ends: 31078 [2021-11-06 12:01:59,529 INFO L226 Difference]: Without dead ends: 23690 [2021-11-06 12:01:59,540 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23690 states. [2021-11-06 12:02:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23690 to 8689. [2021-11-06 12:02:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8689 states, 8678 states have (on average 1.293500806637474) internal successors, (11225), 8688 states have internal predecessors, (11225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8689 states to 8689 states and 11225 transitions. [2021-11-06 12:02:00,729 INFO L78 Accepts]: Start accepts. Automaton has 8689 states and 11225 transitions. Word has length 59 [2021-11-06 12:02:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:00,729 INFO L470 AbstractCegarLoop]: Abstraction has 8689 states and 11225 transitions. [2021-11-06 12:02:00,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 8689 states and 11225 transitions. [2021-11-06 12:02:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-06 12:02:00,730 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:00,730 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:00,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 12:02:00,731 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -940767085, now seen corresponding path program 1 times [2021-11-06 12:02:00,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:00,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220222969] [2021-11-06 12:02:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:00,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:00,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:00,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220222969] [2021-11-06 12:02:00,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220222969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:00,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:00,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 12:02:00,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008506335] [2021-11-06 12:02:00,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 12:02:00,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 12:02:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:02:00,836 INFO L87 Difference]: Start difference. First operand 8689 states and 11225 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:07,114 INFO L93 Difference]: Finished difference Result 45877 states and 59552 transitions. [2021-11-06 12:02:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-06 12:02:07,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 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 60 [2021-11-06 12:02:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:07,177 INFO L225 Difference]: With dead ends: 45877 [2021-11-06 12:02:07,178 INFO L226 Difference]: Without dead ends: 38193 [2021-11-06 12:02:07,196 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-11-06 12:02:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38193 states. [2021-11-06 12:02:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38193 to 8635. [2021-11-06 12:02:08,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8635 states, 8624 states have (on average 1.2911641929499071) internal successors, (11135), 8634 states have internal predecessors, (11135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8635 states to 8635 states and 11135 transitions. [2021-11-06 12:02:08,753 INFO L78 Accepts]: Start accepts. Automaton has 8635 states and 11135 transitions. Word has length 60 [2021-11-06 12:02:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:08,753 INFO L470 AbstractCegarLoop]: Abstraction has 8635 states and 11135 transitions. [2021-11-06 12:02:08,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8635 states and 11135 transitions. [2021-11-06 12:02:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 12:02:08,755 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:08,755 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:08,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 12:02:08,755 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash 306863343, now seen corresponding path program 1 times [2021-11-06 12:02:08,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:08,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300324340] [2021-11-06 12:02:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:08,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:08,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:08,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300324340] [2021-11-06 12:02:08,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300324340] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:02:08,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247659742] [2021-11-06 12:02:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:08,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:02:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:02:08,808 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-06 12:02:08,809 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-06 12:02:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:09,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:02:09,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:09,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247659742] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:02:09,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 12:02:09,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 12:02:09,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869188292] [2021-11-06 12:02:09,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:09,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:09,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:09,234 INFO L87 Difference]: Start difference. First operand 8635 states and 11135 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-06 12:02:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:10,609 INFO L93 Difference]: Finished difference Result 17326 states and 22342 transitions. [2021-11-06 12:02:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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 61 [2021-11-06 12:02:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:10,623 INFO L225 Difference]: With dead ends: 17326 [2021-11-06 12:02:10,623 INFO L226 Difference]: Without dead ends: 8699 [2021-11-06 12:02:10,631 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:10,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8699 states. [2021-11-06 12:02:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8699 to 8683. [2021-11-06 12:02:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8683 states, 8672 states have (on average 1.2895525830258303) internal successors, (11183), 8682 states have internal predecessors, (11183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:11,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 11183 transitions. [2021-11-06 12:02:11,817 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 11183 transitions. Word has length 61 [2021-11-06 12:02:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:11,818 INFO L470 AbstractCegarLoop]: Abstraction has 8683 states and 11183 transitions. [2021-11-06 12:02:11,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 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-06 12:02:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 11183 transitions. [2021-11-06 12:02:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 12:02:11,822 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:11,822 INFO L513 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, 1, 1, 1, 1, 1] [2021-11-06 12:02:11,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-06 12:02:12,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-06 12:02:12,036 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:12,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:12,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1699998706, now seen corresponding path program 1 times [2021-11-06 12:02:12,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:12,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449279207] [2021-11-06 12:02:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:12,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:12,207 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-06 12:02:12,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:12,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449279207] [2021-11-06 12:02:12,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449279207] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:12,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:12,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 12:02:12,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336964315] [2021-11-06 12:02:12,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 12:02:12,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 12:02:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:02:12,210 INFO L87 Difference]: Start difference. First operand 8683 states and 11183 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:17,257 INFO L93 Difference]: Finished difference Result 32108 states and 41418 transitions. [2021-11-06 12:02:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-06 12:02:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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 62 [2021-11-06 12:02:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:17,300 INFO L225 Difference]: With dead ends: 32108 [2021-11-06 12:02:17,300 INFO L226 Difference]: Without dead ends: 26767 [2021-11-06 12:02:17,313 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=570, Invalid=2082, Unknown=0, NotChecked=0, Total=2652 [2021-11-06 12:02:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26767 states. [2021-11-06 12:02:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26767 to 8657. [2021-11-06 12:02:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8657 states, 8646 states have (on average 1.2867221836687486) internal successors, (11125), 8656 states have internal predecessors, (11125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 11125 transitions. [2021-11-06 12:02:18,745 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 11125 transitions. Word has length 62 [2021-11-06 12:02:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:18,745 INFO L470 AbstractCegarLoop]: Abstraction has 8657 states and 11125 transitions. [2021-11-06 12:02:18,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 11125 transitions. [2021-11-06 12:02:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 12:02:18,747 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:18,747 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:18,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 12:02:18,747 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:18,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 905815513, now seen corresponding path program 1 times [2021-11-06 12:02:18,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:18,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026939879] [2021-11-06 12:02:18,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:18,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:18,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:18,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026939879] [2021-11-06 12:02:18,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026939879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:18,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:18,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 12:02:18,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038584272] [2021-11-06 12:02:18,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:02:18,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:18,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:02:18,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:02:18,814 INFO L87 Difference]: Start difference. First operand 8657 states and 11125 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:27,869 INFO L93 Difference]: Finished difference Result 55524 states and 73067 transitions. [2021-11-06 12:02:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 12:02:27,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 63 [2021-11-06 12:02:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:27,963 INFO L225 Difference]: With dead ends: 55524 [2021-11-06 12:02:27,963 INFO L226 Difference]: Without dead ends: 50431 [2021-11-06 12:02:27,981 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-06 12:02:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50431 states. [2021-11-06 12:02:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50431 to 8621. [2021-11-06 12:02:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8621 states, 8610 states have (on average 1.2816492450638792) internal successors, (11035), 8620 states have internal predecessors, (11035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8621 states to 8621 states and 11035 transitions. [2021-11-06 12:02:29,592 INFO L78 Accepts]: Start accepts. Automaton has 8621 states and 11035 transitions. Word has length 63 [2021-11-06 12:02:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:29,593 INFO L470 AbstractCegarLoop]: Abstraction has 8621 states and 11035 transitions. [2021-11-06 12:02:29,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8621 states and 11035 transitions. [2021-11-06 12:02:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-06 12:02:29,594 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:29,594 INFO L513 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:29,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 12:02:29,595 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -86443031, now seen corresponding path program 1 times [2021-11-06 12:02:29,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:29,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704248934] [2021-11-06 12:02:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:29,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:02:29,748 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-06 12:02:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:02:29,961 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-06 12:02:29,962 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-06 12:02:29,962 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,964 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:29,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 12:02:29,969 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:29,971 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 12:02:30,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:02:30 BoogieIcfgContainer [2021-11-06 12:02:30,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 12:02:30,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 12:02:30,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 12:02:30,189 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 12:02:30,189 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:01:20" (3/4) ... [2021-11-06 12:02:30,191 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 12:02:30,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 12:02:30,192 INFO L168 Benchmark]: Toolchain (without parser) took 74182.01 ms. Allocated memory was 86.0 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 62.8 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 136.9 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:30,193 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 86.0 MB. Free memory was 56.6 MB in the beginning and 56.6 MB in the end (delta: 25.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:02:30,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1229.86 ms. Allocated memory was 86.0 MB in the beginning and 134.2 MB in the end (delta: 48.2 MB). Free memory was 62.5 MB in the beginning and 66.9 MB in the end (delta: -4.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:30,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.21 ms. Allocated memory is still 134.2 MB. Free memory was 66.9 MB in the beginning and 52.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:30,193 INFO L168 Benchmark]: Boogie Preprocessor took 155.72 ms. Allocated memory is still 134.2 MB. Free memory was 52.2 MB in the beginning and 72.7 MB in the end (delta: -20.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:30,194 INFO L168 Benchmark]: RCFGBuilder took 3181.03 ms. Allocated memory was 134.2 MB in the beginning and 190.8 MB in the end (delta: 56.6 MB). Free memory was 72.7 MB in the beginning and 65.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 87.0 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:30,194 INFO L168 Benchmark]: TraceAbstraction took 69478.85 ms. Allocated memory was 190.8 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 65.1 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 16.1 GB. [2021-11-06 12:02:30,194 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 4.2 GB. Free memory is still 4.0 GB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:02:30,195 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 86.0 MB. Free memory was 56.6 MB in the beginning and 56.6 MB in the end (delta: 25.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1229.86 ms. Allocated memory was 86.0 MB in the beginning and 134.2 MB in the end (delta: 48.2 MB). Free memory was 62.5 MB in the beginning and 66.9 MB in the end (delta: -4.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 127.21 ms. Allocated memory is still 134.2 MB. Free memory was 66.9 MB in the beginning and 52.2 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 155.72 ms. Allocated memory is still 134.2 MB. Free memory was 52.2 MB in the beginning and 72.7 MB in the end (delta: -20.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3181.03 ms. Allocated memory was 134.2 MB in the beginning and 190.8 MB in the end (delta: 56.6 MB). Free memory was 72.7 MB in the beginning and 65.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 87.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 69478.85 ms. Allocated memory was 190.8 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 65.1 MB in the beginning and 4.0 GB in the end (delta: -3.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 16.1 GB. * Witness Printer took 3.03 ms. Allocated memory is still 4.2 GB. Free memory is still 4.0 GB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 5143, overapproximation of bitwiseAnd at line 6104. Possible FailurePath: [L5149] static struct lock_class_key __key___7 ; [L5150] static struct lock_class_key __key___8 ; [L5290-L5303] static char const __mod_author31[46] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'S', (char const )'e', (char const )'b', (char const )'a', (char const )'s', (char const )'t', (char const )'i', (char const )'a', (char const )'n', (char const )' ', (char const )'H', (char const )'a', (char const )'a', (char const )'s', (char const )' ', (char const )'<', (char const )'h', (char const )'a', (char const )'a', (char const )'s', (char const )'@', (char const )'e', (char const )'m', (char const )'s', (char const )'-', (char const )'w', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )'.', (char const )'c', (char const )'o', (char const )'m', (char const )'>', (char const )'\000'}; [L5304-L5323] static char const __mod_description32[70] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'N', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )' ', (char const )'f', (char const )'o', (char const )'r', (char const )' ', (char const )'E', (char const )'M', (char const )'S', (char const )' ', (char const )'D', (char const )'r', (char const )'.', (char const )' ', (char const )'T', (char const )'h', (char const )'o', (char const )'m', (char const )'a', (char const )'s', (char const )' ', (char const )'W', (char const )'u', (char const )'e', (char const )'n', (char const )'s', (char const )'c', (char const )'h', (char const )'e', (char const )' ', (char const )'C', (char const )'A', (char const )'N', (char const )'/', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'i', (char const )'n', (char const )'t', (char const )'e', (char const )'r', (char const )'f', (char const )'a', (char const )'c', (char const )'e', (char const )'s', (char const )'\000'}; [L5324-L5329] static char const __mod_license33[15] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )' ', (char const )'v', (char const )'2', (char const )'\000'}; [L5330-L5332] static struct usb_device_id ems_usb_table[1] = { {(__u16 )3, (__u16 )4822, (__u16 )1092, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6247-L6287] static struct net_device_ops const ems_usb_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & ems_usb_open, & ems_usb_close, & ems_usb_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , void *addr ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, (int (*)(struct net_device *dev , int new_mtu ))0, (int (*)(struct net_device *dev , struct neigh_parms * ))0, (void (*)(struct net_device *dev ))0, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6288-L6292] static struct can_bittiming_const ems_usb_bittiming_const = {{(char )'e', (char )'m', (char )'s', (char )'_', (char )'u', (char )'s', (char )'b', (char )'\000', (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}, (__u32 )1, (__u32 )16, (__u32 )1, (__u32 )8, (__u32 )4, (__u32 )1, (__u32 )64, (__u32 )1}; [L6543-L6561] static struct usb_driver ems_usb_driver = {"ems_usb", & ems_usb_probe, & ems_usb_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(ems_usb_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6614] int LDV_IN_INTERRUPT ; [L6615] static int res_ems_usb_open_10 ; [L6616] static int res_ems_usb_close_12 ; [L6617] static int res_ems_usb_probe_16 ; [L6767] int ldv_urb_state = 0; [L6768] int ldv_coherent_state = 0; VAL [__key___7={107:0}, __key___8={129:0}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6619] struct net_device *var_group1 ; [L6620] struct sk_buff *var_group2 ; [L6621] struct usb_interface *var_group3 ; [L6622] struct usb_device_id const *var_ems_usb_probe_16_p1 ; [L6623] int tmp___7 ; [L6624] int ldv_s_ems_usb_netdev_ops_net_device_ops ; [L6625] int ldv_s_ems_usb_driver_usb_driver ; [L6626] int tmp___8 ; [L6627] int tmp___9 ; [L6630] LDV_IN_INTERRUPT = 1 VAL [__key___7={107:0}, __key___8={129:0}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6565] int err ; [L5140] int tmp___7 ; [L5143] CALL, EXPR usb_register_driver(driver, & __this_module, "ems_usb") [L7025] return __VERIFIER_nondet_int(); [L5143] tmp___7 = usb_register_driver(driver, & __this_module, "ems_usb") [L5145] return (tmp___7); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6569] err = usb_register(& ems_usb_driver) [L6571] COND FALSE !(\read(err)) [L6578] return (0); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6632] tmp___7 = ems_usb_init() [L6634] COND FALSE !(\read(tmp___7)) [L6638] ldv_s_ems_usb_netdev_ops_net_device_ops = 0 [L6639] ldv_s_ems_usb_driver_usb_driver = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND TRUE \read(tmp___9) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6655] tmp___8 = __VERIFIER_nondet_int() [L6657] COND FALSE !(tmp___8 == 0) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6660] COND FALSE !(tmp___8 == 1) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6663] COND TRUE tmp___8 == 2 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6048] struct ems_usb *dev ; [L6049] void *tmp___7 ; [L6050] struct ems_tx_urb_context *context ; [L6051] struct net_device_stats *stats ; [L6052] struct can_frame *cf ; [L6053] struct ems_cpc_msg *msg ; [L6054] struct urb *urb ; [L6055] u8 *buf ; [L6056] int i ; [L6057] int err ; [L6058] size_t size ; [L6059] int tmp___8 ; [L6060] void *tmp___9 ; [L6061] unsigned int tmp___10 ; [L6062] int tmp___11 ; [L6063] long tmp___12 ; [L4976] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6066] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6067] dev = (struct ems_usb *)tmp___7 [L6068] context = (struct ems_tx_urb_context *)((void *)0) [L6069] stats = & netdev->stats [L6070] EXPR skb->data [L6070] cf = (struct can_frame *)skb->data [L6071] size = 15UL + sizeof(struct cpc_can_msg ) [L5252] struct can_frame const *cf ; [L5253] int tmp___7 ; [L5254] long tmp___8 ; [L5256] EXPR skb->data [L5256] cf = (struct can_frame const *)((struct can_frame *)skb->data) [L5257] EXPR skb->len VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5257] COND FALSE !((unsigned long )skb->len != sizeof(*cf)) [L5260] EXPR cf->can_dlc VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5260] COND FALSE !((int const )cf->can_dlc > 8) [L5263] tmp___7 = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5266] tmp___8 = __builtin_expect((long )tmp___7, 0L) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L5268] COND FALSE !(\read(tmp___8)) [L5276] return (0); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6072] tmp___8 = can_dropped_invalid_skb(netdev, skb) [L6074] COND FALSE !(\read(tmp___8)) [L6830] void *arbitrary_memory ; [L6831] void *tmp___7 ; VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6834] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] return ldv_malloc(0UL); [L6837] tmp___7 = ldv_undefined_pointer() [L6838] arbitrary_memory = tmp___7 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6840] COND FALSE !(! arbitrary_memory) [L6844] ldv_urb_state = ldv_urb_state + 1 [L6845] return ((struct urb *)arbitrary_memory); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6079] urb = usb_alloc_urb(0, 32U) [L6081] COND FALSE !(! urb) [L6089] EXPR dev->udev [L6773] void *arbitrary_memory ; [L6774] void *tmp___7 ; VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6777] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6911] COND FALSE !(__VERIFIER_nondet_bool()) [L6912] return malloc(size); [L6982] return ldv_malloc(0UL); [L6780] tmp___7 = ldv_undefined_pointer() [L6781] arbitrary_memory = tmp___7 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6783] COND FALSE !(! arbitrary_memory) [L6787] ldv_coherent_state = ldv_coherent_state + 1 [L6788] return (arbitrary_memory); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6089] tmp___9 = usb_alloc_coherent(dev->udev, size, 32U, & urb->transfer_dma) [L6090] buf = (u8 *)tmp___9 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6092] COND FALSE !(! buf) [L6100] msg = (struct ems_cpc_msg *)(buf + 4) [L6101] EXPR cf->can_id [L6101] msg->msg.can_msg.id = cf->can_id & 536870911U [L6102] EXPR cf->can_dlc [L6102] msg->msg.can_msg.length = cf->can_dlc [L6103] EXPR cf->can_id VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6103] COND TRUE cf->can_id & 1073741824U [L6104] EXPR cf->can_id VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6104] COND TRUE cf->can_id & 2147483648U [L6105] msg->type = (u8 )16 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6109] msg->length = (u8 )5 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6132] EXPR msg->msg.can_msg.id [L6132] msg->msg.can_msg.id = msg->msg.can_msg.id [L6133] i = 0 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6135] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6137] COND TRUE i < 10 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] EXPR dev->tx_contexts[i].echo_index VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6141] COND TRUE dev->tx_contexts[i].echo_index == 10U [L6142] context = & dev->tx_contexts[i] VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6151] COND TRUE ! context [L6154] dev->udev [L6154] urb->transfer_dma [L6802] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6804] COND FALSE !(! ((unsigned long )addr != (unsigned long )((void *)0))) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6810] COND TRUE \read(*addr) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6811] COND TRUE ldv_coherent_state >= 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=1, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6817] ldv_coherent_state = ldv_coherent_state - 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6155] netdev->dev.parent [L6157] return ((netdev_tx_t )16); VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6641] COND TRUE 1 VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6644] tmp___9 = __VERIFIER_nondet_int() [L6646] COND FALSE !(\read(tmp___9)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6648] COND FALSE !(! (ldv_s_ems_usb_netdev_ops_net_device_ops == 0)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6650] COND FALSE !(! (ldv_s_ems_usb_driver_usb_driver == 0)) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6889] COND FALSE !(ldv_urb_state == 0) VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] [L6754] reach_error() VAL [__key___7={107:0}, __key___8={129:0}, __this_module={18446744073709551617:18446744073709551622}, ems_usb_bittiming_const={81:0}, ems_usb_driver={89:0}, ems_usb_netdev_ops={135:0}, ems_usb_table={90:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, res_ems_usb_close_12=0, res_ems_usb_open_10=0, res_ems_usb_probe_16=0] - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 410 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 69.2s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 48.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 29238 SDtfs, 45287 SDslu, 64408 SDs, 0 SdLazy, 3034 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2938 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8814occurred in iteration=23, InterpolantAutomatonStates: 327, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 211294 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1499 NumberOfCodeBlocks, 1499 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1406 ConstructedInterpolants, 0 QuantifiedInterpolants, 2204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 29 InterpolantComputations, 27 PerfectInterpolantSequences, 35/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 12:02:30,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:02:32,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:02:32,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:02:32,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:02:32,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:02:32,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:02:32,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:02:32,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:02:32,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:02:32,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:02:32,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:02:32,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:02:32,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:02:32,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:02:32,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:02:32,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:02:32,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:02:32,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:02:32,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:02:32,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:02:32,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:02:32,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:02:32,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:02:32,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:02:32,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:02:32,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:02:32,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:02:32,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:02:32,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:02:32,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:02:32,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:02:32,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:02:32,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:02:32,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:02:32,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:02:32,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:02:32,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:02:32,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:02:32,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:02:32,307 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:02:32,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:02:32,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 12:02:32,339 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:02:32,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:02:32,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:02:32,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:02:32,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:02:32,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:02:32,342 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:02:32,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:02:32,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:02:32,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:02:32,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:02:32,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:02:32,344 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 12:02:32,344 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 12:02:32,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:02:32,344 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:02:32,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:02:32,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:02:32,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:02:32,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:02:32,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:02:32,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:02:32,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:02:32,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:02:32,345 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 12:02:32,346 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-11-06 12:02:32,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:02:32,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:02:32,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:02:32,653 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:02:32,654 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:02:32,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-06 12:02:32,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2457fa902/622e374ba1db4f67b952dabd7d6d66cf/FLAG3a4611b7d [2021-11-06 12:02:33,328 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:02:33,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-06 12:02:33,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2457fa902/622e374ba1db4f67b952dabd7d6d66cf/FLAG3a4611b7d [2021-11-06 12:02:33,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2457fa902/622e374ba1db4f67b952dabd7d6d66cf [2021-11-06 12:02:33,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:02:33,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:02:33,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:02:33,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:02:33,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:02:33,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:33" (1/1) ... [2021-11-06 12:02:33,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19df06fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:33, skipping insertion in model container [2021-11-06 12:02:33,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:33" (1/1) ... [2021-11-06 12:02:33,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:02:33,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:02:34,704 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-06 12:02:34,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:02:34,755 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:02:34,956 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-11-06 12:02:34,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:02:35,101 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:02:35,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35 WrapperNode [2021-11-06 12:02:35,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:02:35,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:02:35,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:02:35,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:02:35,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:02:35,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:02:35,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:02:35,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:02:35,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:02:35,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:02:35,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:02:35,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:02:35,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (1/1) ... [2021-11-06 12:02:35,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:02:35,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:02:35,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 12:02:35,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 12:02:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 12:02:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 12:02:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 12:02:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 12:02:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 12:02:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-06 12:02:35,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-06 12:02:35,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 12:02:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 12:02:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 12:02:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-06 12:02:35,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:02:35,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:02:35,845 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:02:52,088 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2021-11-06 12:02:52,088 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2021-11-06 12:02:52,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:02:52,095 INFO L299 CfgBuilder]: Removed 434 assume(true) statements. [2021-11-06 12:02:52,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:52 BoogieIcfgContainer [2021-11-06 12:02:52,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:02:52,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:02:52,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:02:52,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:02:52,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:02:33" (1/3) ... [2021-11-06 12:02:52,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54851c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:52, skipping insertion in model container [2021-11-06 12:02:52,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:35" (2/3) ... [2021-11-06 12:02:52,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54851c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:52, skipping insertion in model container [2021-11-06 12:02:52,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:52" (3/3) ... [2021-11-06 12:02:52,105 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-11-06 12:02:52,108 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:02:52,108 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2021-11-06 12:02:52,140 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:02:52,144 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 12:02:52,144 INFO L340 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2021-11-06 12:02:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 12:02:52,162 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:52,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:52,163 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1465825715, now seen corresponding path program 1 times [2021-11-06 12:02:52,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:52,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918943394] [2021-11-06 12:02:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:52,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:52,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:52,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:02:52,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 12:02:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:52,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:02:52,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:52,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:52,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:52,838 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:52,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918943394] [2021-11-06 12:02:52,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918943394] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:52,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:52,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 12:02:52,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673665621] [2021-11-06 12:02:52,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:52,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:52,866 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.5025125628140703) internal successors, (598), 409 states have internal predecessors, (598), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:53,248 INFO L93 Difference]: Finished difference Result 1189 states and 1749 transitions. [2021-11-06 12:02:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:53,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2021-11-06 12:02:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:53,267 INFO L225 Difference]: With dead ends: 1189 [2021-11-06 12:02:53,267 INFO L226 Difference]: Without dead ends: 765 [2021-11-06 12:02:53,270 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:53,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2021-11-06 12:02:53,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 747. [2021-11-06 12:02:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 736 states have (on average 1.327445652173913) internal successors, (977), 746 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 977 transitions. [2021-11-06 12:02:53,363 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 977 transitions. Word has length 10 [2021-11-06 12:02:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:53,364 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 977 transitions. [2021-11-06 12:02:53,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 977 transitions. [2021-11-06 12:02:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-06 12:02:53,366 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:53,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:53,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-06 12:02:53,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:02:53,580 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1804042980, now seen corresponding path program 1 times [2021-11-06 12:02:53,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:53,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294839004] [2021-11-06 12:02:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:53,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:53,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:53,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:02:53,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 12:02:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:54,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:02:54,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:54,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:54,351 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:54,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294839004] [2021-11-06 12:02:54,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294839004] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:54,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:54,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 12:02:54,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661672052] [2021-11-06 12:02:54,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:54,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:54,353 INFO L87 Difference]: Start difference. First operand 747 states and 977 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:54,504 INFO L93 Difference]: Finished difference Result 2217 states and 2904 transitions. [2021-11-06 12:02:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:54,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-06 12:02:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:54,510 INFO L225 Difference]: With dead ends: 2217 [2021-11-06 12:02:54,511 INFO L226 Difference]: Without dead ends: 1475 [2021-11-06 12:02:54,513 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-11-06 12:02:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1446. [2021-11-06 12:02:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1435 states have (on average 1.3261324041811846) internal successors, (1903), 1445 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1903 transitions. [2021-11-06 12:02:54,589 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1903 transitions. Word has length 11 [2021-11-06 12:02:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:54,589 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1903 transitions. [2021-11-06 12:02:54,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1903 transitions. [2021-11-06 12:02:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 12:02:54,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:54,592 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:54,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 12:02:54,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:02:54,808 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash 739890622, now seen corresponding path program 1 times [2021-11-06 12:02:54,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:54,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583621928] [2021-11-06 12:02:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:54,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:54,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:54,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:02:54,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 12:02:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:55,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 12:02:55,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:55,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:55,807 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:55,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583621928] [2021-11-06 12:02:55,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583621928] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:55,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:55,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 12:02:55,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168885918] [2021-11-06 12:02:55,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:55,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:55,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:55,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:55,809 INFO L87 Difference]: Start difference. First operand 1446 states and 1903 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:55,945 INFO L93 Difference]: Finished difference Result 2886 states and 3799 transitions. [2021-11-06 12:02:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:55,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2021-11-06 12:02:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:55,950 INFO L225 Difference]: With dead ends: 2886 [2021-11-06 12:02:55,950 INFO L226 Difference]: Without dead ends: 1446 [2021-11-06 12:02:55,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2021-11-06 12:02:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1446. [2021-11-06 12:02:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1435 states have (on average 1.3254355400696864) internal successors, (1902), 1445 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1902 transitions. [2021-11-06 12:02:55,987 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1902 transitions. Word has length 38 [2021-11-06 12:02:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:55,987 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 1902 transitions. [2021-11-06 12:02:55,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1902 transitions. [2021-11-06 12:02:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 12:02:55,989 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:55,989 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:56,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 12:02:56,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:02:56,204 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash 667504064, now seen corresponding path program 1 times [2021-11-06 12:02:56,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:56,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499072242] [2021-11-06 12:02:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:56,206 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:56,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:02:56,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 12:02:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:56,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:02:56,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:56,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:57,219 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:57,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499072242] [2021-11-06 12:02:57,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499072242] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:57,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:57,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 12:02:57,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727503308] [2021-11-06 12:02:57,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:57,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:57,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:57,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:57,221 INFO L87 Difference]: Start difference. First operand 1446 states and 1902 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:57,400 INFO L93 Difference]: Finished difference Result 4964 states and 6618 transitions. [2021-11-06 12:02:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 12:02:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:57,412 INFO L225 Difference]: With dead ends: 4964 [2021-11-06 12:02:57,413 INFO L226 Difference]: Without dead ends: 3525 [2021-11-06 12:02:57,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:57,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3525 states. [2021-11-06 12:02:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3525 to 3461. [2021-11-06 12:02:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3461 states, 3450 states have (on average 1.3504347826086958) internal successors, (4659), 3460 states have internal predecessors, (4659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 4659 transitions. [2021-11-06 12:02:57,498 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 4659 transitions. Word has length 38 [2021-11-06 12:02:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:57,498 INFO L470 AbstractCegarLoop]: Abstraction has 3461 states and 4659 transitions. [2021-11-06 12:02:57,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4659 transitions. [2021-11-06 12:02:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 12:02:57,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:57,502 INFO L513 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] [2021-11-06 12:02:57,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 12:02:57,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:02:57,738 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1703756643, now seen corresponding path program 1 times [2021-11-06 12:02:57,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:57,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404054884] [2021-11-06 12:02:57,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:57,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:57,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:57,740 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:02:57,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 12:02:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:58,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:02:58,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:58,448 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-06 12:02:58,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:58,705 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-06 12:02:58,705 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:58,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404054884] [2021-11-06 12:02:58,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404054884] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:58,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:58,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:02:58,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309954760] [2021-11-06 12:02:58,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:02:58,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:02:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:02:58,707 INFO L87 Difference]: Start difference. First operand 3461 states and 4659 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:59,080 INFO L93 Difference]: Finished difference Result 13736 states and 18468 transitions. [2021-11-06 12:02:59,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:02:59,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 41 [2021-11-06 12:02:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:59,114 INFO L225 Difference]: With dead ends: 13736 [2021-11-06 12:02:59,115 INFO L226 Difference]: Without dead ends: 10283 [2021-11-06 12:02:59,122 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:02:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10283 states. [2021-11-06 12:02:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10283 to 3485. [2021-11-06 12:02:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 3474 states have (on average 1.348013816925734) internal successors, (4683), 3484 states have internal predecessors, (4683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 4683 transitions. [2021-11-06 12:02:59,330 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 4683 transitions. Word has length 41 [2021-11-06 12:02:59,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:59,330 INFO L470 AbstractCegarLoop]: Abstraction has 3485 states and 4683 transitions. [2021-11-06 12:02:59,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:02:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 4683 transitions. [2021-11-06 12:02:59,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:02:59,331 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:59,332 INFO L513 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] [2021-11-06 12:02:59,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-06 12:02:59,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:02:59,562 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:02:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1337408933, now seen corresponding path program 1 times [2021-11-06 12:02:59,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:59,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661216985] [2021-11-06 12:02:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:59,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:59,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:59,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:02:59,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 12:03:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:00,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:03:00,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:00,272 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-06 12:03:00,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:00,517 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-06 12:03:00,517 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:00,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661216985] [2021-11-06 12:03:00,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661216985] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:00,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:00,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:03:00,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150945586] [2021-11-06 12:03:00,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:03:00,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:03:00,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:03:00,519 INFO L87 Difference]: Start difference. First operand 3485 states and 4683 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:00,916 INFO L93 Difference]: Finished difference Result 11840 states and 15908 transitions. [2021-11-06 12:03:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:03:00,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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 42 [2021-11-06 12:03:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:00,959 INFO L225 Difference]: With dead ends: 11840 [2021-11-06 12:03:00,959 INFO L226 Difference]: Without dead ends: 8363 [2021-11-06 12:03:00,968 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:03:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8363 states. [2021-11-06 12:03:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8363 to 3509. [2021-11-06 12:03:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 3498 states have (on average 1.3456260720411664) internal successors, (4707), 3508 states have internal predecessors, (4707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 4707 transitions. [2021-11-06 12:03:01,158 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 4707 transitions. Word has length 42 [2021-11-06 12:03:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:01,160 INFO L470 AbstractCegarLoop]: Abstraction has 3509 states and 4707 transitions. [2021-11-06 12:03:01,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 4707 transitions. [2021-11-06 12:03:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:03:01,161 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:01,161 INFO L513 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] [2021-11-06 12:03:01,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 12:03:01,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:01,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:01,376 INFO L85 PathProgramCache]: Analyzing trace with hash -283318246, now seen corresponding path program 1 times [2021-11-06 12:03:01,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:01,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053495458] [2021-11-06 12:03:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:01,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:01,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:01,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:01,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 12:03:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:01,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 12:03:01,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:02,238 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-06 12:03:02,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:02,417 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-06 12:03:02,418 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:02,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053495458] [2021-11-06 12:03:02,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053495458] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:02,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:02,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:03:02,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234262632] [2021-11-06 12:03:02,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:03:02,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:03:02,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:03:02,419 INFO L87 Difference]: Start difference. First operand 3509 states and 4707 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:04,101 INFO L93 Difference]: Finished difference Result 19088 states and 25593 transitions. [2021-11-06 12:03:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:03:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2021-11-06 12:03:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:04,130 INFO L225 Difference]: With dead ends: 19088 [2021-11-06 12:03:04,130 INFO L226 Difference]: Without dead ends: 17298 [2021-11-06 12:03:04,136 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:03:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17298 states. [2021-11-06 12:03:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17298 to 3593. [2021-11-06 12:03:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3582 states have (on average 1.3375209380234505) internal successors, (4791), 3592 states have internal predecessors, (4791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 4791 transitions. [2021-11-06 12:03:04,412 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 4791 transitions. Word has length 42 [2021-11-06 12:03:04,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:04,413 INFO L470 AbstractCegarLoop]: Abstraction has 3593 states and 4791 transitions. [2021-11-06 12:03:04,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 4791 transitions. [2021-11-06 12:03:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 12:03:04,415 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:04,415 INFO L513 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] [2021-11-06 12:03:04,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 12:03:04,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:04,632 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1871666148, now seen corresponding path program 1 times [2021-11-06 12:03:04,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:04,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886488085] [2021-11-06 12:03:04,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:04,634 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:04,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:04,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:04,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 12:03:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:05,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:03:05,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:05,492 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-06 12:03:05,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:05,652 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-06 12:03:05,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:05,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886488085] [2021-11-06 12:03:05,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886488085] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:05,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:05,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-06 12:03:05,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512536442] [2021-11-06 12:03:05,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:03:05,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:03:05,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:03:05,654 INFO L87 Difference]: Start difference. First operand 3593 states and 4791 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:14,072 INFO L93 Difference]: Finished difference Result 27795 states and 37313 transitions. [2021-11-06 12:03:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 12:03:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 42 [2021-11-06 12:03:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:14,126 INFO L225 Difference]: With dead ends: 27795 [2021-11-06 12:03:14,126 INFO L226 Difference]: Without dead ends: 24210 [2021-11-06 12:03:14,137 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-06 12:03:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24210 states. [2021-11-06 12:03:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24210 to 3563. [2021-11-06 12:03:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3552 states have (on average 1.3324887387387387) internal successors, (4733), 3562 states have internal predecessors, (4733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4733 transitions. [2021-11-06 12:03:14,517 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4733 transitions. Word has length 42 [2021-11-06 12:03:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:14,518 INFO L470 AbstractCegarLoop]: Abstraction has 3563 states and 4733 transitions. [2021-11-06 12:03:14,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4733 transitions. [2021-11-06 12:03:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 12:03:14,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:14,519 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:03:14,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-06 12:03:14,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:14,735 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash 567062686, now seen corresponding path program 1 times [2021-11-06 12:03:14,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:14,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2871698] [2021-11-06 12:03:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:14,737 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:14,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:14,738 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:14,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 12:03:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:15,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 12:03:15,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:15,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:15,716 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:15,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2871698] [2021-11-06 12:03:15,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2871698] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:15,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:15,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 12:03:15,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854075523] [2021-11-06 12:03:15,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:03:15,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:15,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:03:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:03:15,717 INFO L87 Difference]: Start difference. First operand 3563 states and 4733 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:17,375 INFO L93 Difference]: Finished difference Result 12089 states and 16109 transitions. [2021-11-06 12:03:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:03:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2021-11-06 12:03:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:17,400 INFO L225 Difference]: With dead ends: 12089 [2021-11-06 12:03:17,400 INFO L226 Difference]: Without dead ends: 8534 [2021-11-06 12:03:17,405 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:03:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8534 states. [2021-11-06 12:03:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8534 to 3171. [2021-11-06 12:03:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3160 states have (on average 1.32626582278481) internal successors, (4191), 3170 states have internal predecessors, (4191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4191 transitions. [2021-11-06 12:03:17,718 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4191 transitions. Word has length 44 [2021-11-06 12:03:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:17,719 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 4191 transitions. [2021-11-06 12:03:17,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4191 transitions. [2021-11-06 12:03:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 12:03:17,720 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:17,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:03:17,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 12:03:17,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:17,923 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash -2142949410, now seen corresponding path program 1 times [2021-11-06 12:03:17,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:17,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179209090] [2021-11-06 12:03:17,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:17,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:17,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:17,930 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:17,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 12:03:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:18,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:03:18,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:19,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:19,572 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:19,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179209090] [2021-11-06 12:03:19,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179209090] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:19,573 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:19,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-06 12:03:19,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056032114] [2021-11-06 12:03:19,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:03:19,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:03:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:03:19,574 INFO L87 Difference]: Start difference. First operand 3171 states and 4191 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:23,364 INFO L93 Difference]: Finished difference Result 13252 states and 17567 transitions. [2021-11-06 12:03:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:03:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 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 44 [2021-11-06 12:03:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:23,380 INFO L225 Difference]: With dead ends: 13252 [2021-11-06 12:03:23,380 INFO L226 Difference]: Without dead ends: 11405 [2021-11-06 12:03:23,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:03:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11405 states. [2021-11-06 12:03:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11405 to 9847. [2021-11-06 12:03:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9847 states, 9836 states have (on average 1.324623830825539) internal successors, (13029), 9846 states have internal predecessors, (13029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9847 states to 9847 states and 13029 transitions. [2021-11-06 12:03:24,367 INFO L78 Accepts]: Start accepts. Automaton has 9847 states and 13029 transitions. Word has length 44 [2021-11-06 12:03:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:24,367 INFO L470 AbstractCegarLoop]: Abstraction has 9847 states and 13029 transitions. [2021-11-06 12:03:24,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9847 states and 13029 transitions. [2021-11-06 12:03:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 12:03:24,369 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:24,369 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:03:24,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-06 12:03:24,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:24,585 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1537453454, now seen corresponding path program 1 times [2021-11-06 12:03:24,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:24,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110667203] [2021-11-06 12:03:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:24,586 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:24,588 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:24,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 12:03:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:25,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:03:25,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:25,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:25,709 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:25,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110667203] [2021-11-06 12:03:25,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110667203] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:25,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:25,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 12:03:25,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43550581] [2021-11-06 12:03:25,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:03:25,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:25,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:03:25,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:03:25,710 INFO L87 Difference]: Start difference. First operand 9847 states and 13029 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:27,043 INFO L93 Difference]: Finished difference Result 20142 states and 26962 transitions. [2021-11-06 12:03:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:03:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 12:03:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:27,058 INFO L225 Difference]: With dead ends: 20142 [2021-11-06 12:03:27,058 INFO L226 Difference]: Without dead ends: 10303 [2021-11-06 12:03:27,071 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:03:27,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2021-11-06 12:03:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 10303. [2021-11-06 12:03:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10303 states, 10292 states have (on average 1.3102409638554218) internal successors, (13485), 10302 states have internal predecessors, (13485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10303 states to 10303 states and 13485 transitions. [2021-11-06 12:03:28,103 INFO L78 Accepts]: Start accepts. Automaton has 10303 states and 13485 transitions. Word has length 47 [2021-11-06 12:03:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:28,104 INFO L470 AbstractCegarLoop]: Abstraction has 10303 states and 13485 transitions. [2021-11-06 12:03:28,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 10303 states and 13485 transitions. [2021-11-06 12:03:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 12:03:28,105 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:28,105 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:03:28,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 12:03:28,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:28,320 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1909705166, now seen corresponding path program 1 times [2021-11-06 12:03:28,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:28,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510392501] [2021-11-06 12:03:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:28,321 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:28,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:28,322 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:28,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 12:03:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:28,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 12:03:28,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:29,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:29,900 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:29,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510392501] [2021-11-06 12:03:29,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510392501] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 12:03:29,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 12:03:29,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 12:03:29,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241947285] [2021-11-06 12:03:29,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:03:29,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:29,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:03:29,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:03:29,903 INFO L87 Difference]: Start difference. First operand 10303 states and 13485 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:32,073 INFO L93 Difference]: Finished difference Result 21054 states and 27874 transitions. [2021-11-06 12:03:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:03:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 12:03:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:32,088 INFO L225 Difference]: With dead ends: 21054 [2021-11-06 12:03:32,088 INFO L226 Difference]: Without dead ends: 10759 [2021-11-06 12:03:32,098 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:03:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10759 states. [2021-11-06 12:03:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10759 to 10759. [2021-11-06 12:03:33,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10759 states, 10748 states have (on average 1.2970785262374396) internal successors, (13941), 10758 states have internal predecessors, (13941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10759 states to 10759 states and 13941 transitions. [2021-11-06 12:03:33,140 INFO L78 Accepts]: Start accepts. Automaton has 10759 states and 13941 transitions. Word has length 49 [2021-11-06 12:03:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:33,141 INFO L470 AbstractCegarLoop]: Abstraction has 10759 states and 13941 transitions. [2021-11-06 12:03:33,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 10759 states and 13941 transitions. [2021-11-06 12:03:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 12:03:33,144 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:33,144 INFO L513 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:03:33,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 12:03:33,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:33,363 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:33,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1133652466, now seen corresponding path program 2 times [2021-11-06 12:03:33,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:33,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332072184] [2021-11-06 12:03:33,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 12:03:33,364 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:33,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:33,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 12:03:33,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 12:03:33,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 12:03:33,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:03:33,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 12:03:34,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-06 12:03:34,498 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:34,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332072184] [2021-11-06 12:03:34,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332072184] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:34,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:34,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2021-11-06 12:03:34,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326752680] [2021-11-06 12:03:34,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 12:03:34,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:34,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 12:03:34,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:03:34,499 INFO L87 Difference]: Start difference. First operand 10759 states and 13941 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:03:51,600 INFO L93 Difference]: Finished difference Result 105801 states and 137975 transitions. [2021-11-06 12:03:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-06 12:03:51,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 12:03:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:03:51,799 INFO L225 Difference]: With dead ends: 105801 [2021-11-06 12:03:51,799 INFO L226 Difference]: Without dead ends: 95050 [2021-11-06 12:03:51,833 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-11-06 12:03:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95050 states. [2021-11-06 12:03:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95050 to 10807. [2021-11-06 12:03:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10807 states, 10796 states have (on average 1.2957576880326047) internal successors, (13989), 10806 states have internal predecessors, (13989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 13989 transitions. [2021-11-06 12:03:53,790 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 13989 transitions. Word has length 51 [2021-11-06 12:03:53,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:03:53,790 INFO L470 AbstractCegarLoop]: Abstraction has 10807 states and 13989 transitions. [2021-11-06 12:03:53,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:03:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 13989 transitions. [2021-11-06 12:03:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:03:53,791 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:03:53,792 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:03:53,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-06 12:03:54,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:03:54,008 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:03:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:03:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -61741317, now seen corresponding path program 1 times [2021-11-06 12:03:54,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:03:54,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40150763] [2021-11-06 12:03:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:03:54,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:03:54,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:03:54,011 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:03:54,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 12:03:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:03:54,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:03:54,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:03:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:54,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:03:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:03:55,161 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:03:55,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40150763] [2021-11-06 12:03:55,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40150763] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:03:55,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:03:55,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 12:03:55,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332047278] [2021-11-06 12:03:55,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:03:55,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:03:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:03:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:03:55,163 INFO L87 Difference]: Start difference. First operand 10807 states and 13989 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:00,867 INFO L93 Difference]: Finished difference Result 41931 states and 54176 transitions. [2021-11-06 12:04:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:04:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2021-11-06 12:04:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:00,918 INFO L225 Difference]: With dead ends: 41931 [2021-11-06 12:04:00,918 INFO L226 Difference]: Without dead ends: 31132 [2021-11-06 12:04:00,937 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:04:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31132 states. [2021-11-06 12:04:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31132 to 10184. [2021-11-06 12:04:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10184 states, 10173 states have (on average 1.2911628821389953) internal successors, (13135), 10183 states have internal predecessors, (13135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10184 states to 10184 states and 13135 transitions. [2021-11-06 12:04:02,867 INFO L78 Accepts]: Start accepts. Automaton has 10184 states and 13135 transitions. Word has length 52 [2021-11-06 12:04:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:02,867 INFO L470 AbstractCegarLoop]: Abstraction has 10184 states and 13135 transitions. [2021-11-06 12:04:02,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 10184 states and 13135 transitions. [2021-11-06 12:04:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:04:02,869 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:02,869 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:04:02,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 12:04:03,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:04:03,085 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:04:03,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:03,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1082809671, now seen corresponding path program 1 times [2021-11-06 12:04:03,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:03,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591421914] [2021-11-06 12:04:03,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:03,087 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:03,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:03,088 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:04:03,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 12:04:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:03,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 12:04:03,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:04:04,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:04:04,414 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:04,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591421914] [2021-11-06 12:04:04,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591421914] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:04,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:04,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:04:04,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417678668] [2021-11-06 12:04:04,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:04:04,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:04:04,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:04:04,416 INFO L87 Difference]: Start difference. First operand 10184 states and 13135 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:16,432 INFO L93 Difference]: Finished difference Result 67888 states and 87963 transitions. [2021-11-06 12:04:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 12:04:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2021-11-06 12:04:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:16,562 INFO L225 Difference]: With dead ends: 67888 [2021-11-06 12:04:16,562 INFO L226 Difference]: Without dead ends: 62406 [2021-11-06 12:04:16,584 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 12:04:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62406 states. [2021-11-06 12:04:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62406 to 10364. [2021-11-06 12:04:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10364 states, 10353 states have (on average 1.286100647155414) internal successors, (13315), 10363 states have internal predecessors, (13315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10364 states to 10364 states and 13315 transitions. [2021-11-06 12:04:18,498 INFO L78 Accepts]: Start accepts. Automaton has 10364 states and 13315 transitions. Word has length 52 [2021-11-06 12:04:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:18,498 INFO L470 AbstractCegarLoop]: Abstraction has 10364 states and 13315 transitions. [2021-11-06 12:04:18,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10364 states and 13315 transitions. [2021-11-06 12:04:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 12:04:18,500 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:18,500 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:04:18,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 12:04:18,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:04:18,712 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:04:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1523213883, now seen corresponding path program 1 times [2021-11-06 12:04:18,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:18,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121122356] [2021-11-06 12:04:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:18,713 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:18,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:18,714 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:04:18,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 12:04:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:19,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:04:19,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:04:19,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:04:19,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:19,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121122356] [2021-11-06 12:04:19,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121122356] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:19,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:19,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 12:04:19,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330897551] [2021-11-06 12:04:19,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:04:19,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:04:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:04:19,529 INFO L87 Difference]: Start difference. First operand 10364 states and 13315 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:22,810 INFO L93 Difference]: Finished difference Result 25606 states and 33029 transitions. [2021-11-06 12:04:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:04:22,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 52 [2021-11-06 12:04:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:22,839 INFO L225 Difference]: With dead ends: 25606 [2021-11-06 12:04:22,843 INFO L226 Difference]: Without dead ends: 20034 [2021-11-06 12:04:22,857 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:04:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20034 states. [2021-11-06 12:04:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20034 to 10436. [2021-11-06 12:04:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10436 states, 10425 states have (on average 1.2852757793764988) internal successors, (13399), 10435 states have internal predecessors, (13399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 13399 transitions. [2021-11-06 12:04:24,601 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 13399 transitions. Word has length 52 [2021-11-06 12:04:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:24,601 INFO L470 AbstractCegarLoop]: Abstraction has 10436 states and 13399 transitions. [2021-11-06 12:04:24,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 13399 transitions. [2021-11-06 12:04:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 12:04:24,602 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:24,603 INFO L513 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] [2021-11-06 12:04:24,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-06 12:04:24,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:04:24,816 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:04:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1066011435, now seen corresponding path program 1 times [2021-11-06 12:04:24,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:24,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005964343] [2021-11-06 12:04:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:24,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:24,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:24,819 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:04:24,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-06 12:04:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:25,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 12:04:25,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:26,164 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-06 12:04:26,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:26,461 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-06 12:04:26,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:26,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005964343] [2021-11-06 12:04:26,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005964343] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:26,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:26,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-11-06 12:04:26,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701958259] [2021-11-06 12:04:26,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:04:26,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:04:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:04:26,463 INFO L87 Difference]: Start difference. First operand 10436 states and 13399 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:05:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:05:19,357 INFO L93 Difference]: Finished difference Result 234963 states and 306466 transitions. [2021-11-06 12:05:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-06 12:05:19,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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 53 [2021-11-06 12:05:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:05:20,021 INFO L225 Difference]: With dead ends: 234963 [2021-11-06 12:05:20,021 INFO L226 Difference]: Without dead ends: 224535 [2021-11-06 12:05:20,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2021-11-06 12:05:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224535 states. [2021-11-06 12:05:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224535 to 10280. [2021-11-06 12:05:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10280 states, 10269 states have (on average 1.2831823936118414) internal successors, (13177), 10279 states have internal predecessors, (13177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:05:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10280 states to 10280 states and 13177 transitions. [2021-11-06 12:05:24,363 INFO L78 Accepts]: Start accepts. Automaton has 10280 states and 13177 transitions. Word has length 53 [2021-11-06 12:05:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:05:24,363 INFO L470 AbstractCegarLoop]: Abstraction has 10280 states and 13177 transitions. [2021-11-06 12:05:24,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:05:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 10280 states and 13177 transitions. [2021-11-06 12:05:24,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 12:05:24,364 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:05:24,365 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 12:05:24,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-06 12:05:24,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:05:24,580 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:05:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:05:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1963806063, now seen corresponding path program 1 times [2021-11-06 12:05:24,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:05:24,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991049919] [2021-11-06 12:05:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:05:24,581 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:05:24,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:05:24,582 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:05:24,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-06 12:05:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:05:25,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:05:25,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:05:25,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:05:25,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:05:25,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:05:25,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:05:25,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991049919] [2021-11-06 12:05:25,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991049919] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:05:25,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:05:25,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:05:25,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639801121] [2021-11-06 12:05:25,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:05:25,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:05:25,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:05:25,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:05:25,931 INFO L87 Difference]: Start difference. First operand 10280 states and 13177 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:05:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:05:30,640 INFO L93 Difference]: Finished difference Result 20598 states and 26401 transitions. [2021-11-06 12:05:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:05:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 53 [2021-11-06 12:05:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:05:30,655 INFO L225 Difference]: With dead ends: 20598 [2021-11-06 12:05:30,655 INFO L226 Difference]: Without dead ends: 10324 [2021-11-06 12:05:30,664 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:05:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10324 states. [2021-11-06 12:05:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10324 to 10286. [2021-11-06 12:05:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10286 states, 10275 states have (on average 1.282919708029197) internal successors, (13182), 10285 states have internal predecessors, (13182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:05:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10286 states to 10286 states and 13182 transitions. [2021-11-06 12:05:32,986 INFO L78 Accepts]: Start accepts. Automaton has 10286 states and 13182 transitions. Word has length 53 [2021-11-06 12:05:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:05:32,986 INFO L470 AbstractCegarLoop]: Abstraction has 10286 states and 13182 transitions. [2021-11-06 12:05:32,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:05:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10286 states and 13182 transitions. [2021-11-06 12:05:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-06 12:05:32,987 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:05:32,987 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:05:33,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-11-06 12:05:33,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:05:33,203 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2021-11-06 12:05:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:05:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 430540154, now seen corresponding path program 1 times [2021-11-06 12:05:33,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:05:33,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558518491] [2021-11-06 12:05:33,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:05:33,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:05:33,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:05:33,205 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:05:33,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-06 12:05:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:05:33,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:05:33,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:05:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:05:34,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:05:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:05:35,356 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:05:35,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558518491] [2021-11-06 12:05:35,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558518491] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:05:35,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:05:35,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-06 12:05:35,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141533991] [2021-11-06 12:05:35,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:05:35,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:05:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:05:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:05:35,358 INFO L87 Difference]: Start difference. First operand 10286 states and 13182 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 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)